Magic sets and other strange ways to implement logic programs (extended abstract)
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
The Alexander method-a technique for the processing of recursive axioms in deductive databases
New Generation Computing
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Recursive query processing: the power of logic
Theoretical Computer Science
Query evaluation in recursive databases: bottom-up and top-down reconciled
Data & Knowledge Engineering
XSB as an efficient deductive database engine
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Tail recursion elimination in deductive databases
ACM Transactions on Database Systems (TODS)
From logic programming to Prolog
From logic programming to Prolog
An abstract machine for tabled execution of fixed-order stratified logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
OLD Resolution with Tabulation
Proceedings of the Third International Conference on Logic Programming
Recursive Strategies for Answering Recursive Queries - The RQA/FQI Strategy
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
A Direct Proof for the Completeness of SLD-Resolution
CSL '89 Proceedings of the 3rd Workshop on Computer Science Logic
Efficient fixpoint computation in linear tabling
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Linear tabulated resolution based on Prolog control strategy
Theory and Practice of Logic Programming
Datalog±: a unified approach to ontologies and integrity constraints
Proceedings of the 12th International Conference on Database Theory
RR '09 Proceedings of the 3rd International Conference on Web Reasoning and Rule Systems
On the web ontology rule language OWL 2 RL
ICCCI'11 Proceedings of the Third international conference on Computational collective intelligence: technologies and applications - Volume Part I
WORL: A Web Ontology Rule Language
KSE '11 Proceedings of the 2011 Third International Conference on Knowledge and Systems Engineering
Foundations of Modal Deductive Databases
Fundamenta Informaticae
ICCCI'12 Proceedings of the 4th international conference on Computational Collective Intelligence: technologies and applications - Volume Part I
On the efficiency of query-subquery nets: an experimental point of view
Proceedings of the Fourth Symposium on Information and Communication Technology
| Hi-index | 0.00 |
We generalize the QSQR evaluation method to give the first set-oriented depth-first evaluation method for Horn knowledge bases. The resulting procedure closely simulates SLD-resolution (to take advantages of the goal-directed approach) and highly exploits set-at-a-time tabling. Our generalized QSQR evaluation procedure is sound and complete. It does not use adornments and annotations. To deal with function symbols, our procedure uses iterative deepening search, which iteratively increases term-depth bound for atoms and substitutions occurring in the computation. When the term-depth bound is fixed, our evaluation procedure runs in polynomial time in the size of extensional relations.