Implementation of logical query languages for databases
ACM Transactions on Database Systems (TODS)
OLD resolution with tabulation
Proceedings on Third international conference on logic programming
A message passing framework for logical query evaluation
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Principles of Database and Knowledge-Base Systems: Volume II: The New Technologies
Principles of Database and Knowledge-Base Systems: Volume II: The New Technologies
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Modular acyclicity and tail recursion in logic programs
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Communications of the ACM
Implementing deductive databases by linear programming
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Modular stratification and magic sets for Datalog programs with negation
Journal of the ACM (JACM)
Decomposition of magic rewriting
Journal of the ACM (JACM)
ACM Transactions on Database Systems (TODS)
Tail recursion elimination in deductive databases
ACM Transactions on Database Systems (TODS)
Implementing deductive databases by mixed integer programming
ACM Transactions on Database Systems (TODS)
Perspectives on database theory
ACM SIGACT News
An analysis of magic sets and related optimization strategies for logic queries
Journal of the ACM (JACM)
Relational transducers for electronic commerce
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Modular stratification and magic sets for DATALOG programs with negation
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Deductive database languages: problems and solutions
ACM Computing Surveys (CSUR)
Polynomial-time computation via local inference relations
ACM Transactions on Computational Logic (TOCL)
On the complexity analysis of static analyses
Journal of the ACM (JACM)
Annals of Mathematics and Artificial Intelligence
The Knowledge Acquisition and Representation Language, KARL
IEEE Transactions on Knowledge and Data Engineering
A Computational Model for Functional Logic Deductive Databases
Proceedings of the 17th International Conference on Logic Programming
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
Right-, left- and multi-linear rule transformations that maintain context information
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Efficient Implementation of Loops in Bottom-Up Evaluation of Logic Queries
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
A New Factoring Algorithm for Magic Predicates
ASIAN '98 Proceedings of the 4th Asian Computing Science Conference on Advances in Computing Science
A Framework for Goal-Directed Bottom-Up Evaluation of Functional Logic Programs
FLOPS '01 Proceedings of the 5th International Symposium on Functional and Logic Programming
On the Complexity Analysis of Static Analyses
SAS '99 Proceedings of the 6th International Symposium on Static Analysis
Meta-complexity Theorems: Talk Abstract
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
SLDMagic - The Real Magic (With Applications to Web Queries)
CL '00 Proceedings of the First International Conference on Computational Logic
On preservation under homomorphisms and unions of conjunctive queries
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Context-sensitive program analysis as database queries
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Optimization of bound disjunctive queries with constraints
Theory and Practice of Logic Programming
On preservation under homomorphisms and unions of conjunctive queries
Journal of the ACM (JACM)
Hierarchical and Modular Reasoning in Complex Theories: The Case of Local Theory Extensions
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Precise complexity analysis for efficient datalog queries
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
More efficient datalog queries: subsumptive tabling beats magic sets
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Using datalog with binary decision diagrams for program analysis
APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems
Proceedings of the 14th symposium on Principles and practice of declarative programming
Parallel Computing
| Hi-index | 0.02 |
We show that for any safe datalog program P1 and any query Q (predicate of P1 with some bound arguments), there is another safe datalog program P2 that produces the answer to Q and takes no more time when evaluated by semi-naive evaluation than when P1 is evaluated topdown.