On compiling queries in recursive first-order databases
Journal of the ACM (JACM)
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.)
Journal of Automated Reasoning
Query evaluation in recursive databases: bottom-up and top-down reconciled
Data & Knowledge Engineering
Refutation search for Horn sets by a subgoal-extraction method
Journal of Logic Programming
An efficient strategy for non-Horn deductive databases
Selected papers of the workshop on Deductive database theory
Journal of Automated Reasoning
Semantics of Horn and disjunctive logic programs
Theoretical Computer Science
Foundations of disjunctive logic programming
Foundations of disjunctive logic programming
Representations for disjunctive deductive database
Representations for disjunctive deductive database
View updates in stratified disjunctive databases
Journal of Automated Reasoning
Backward chaining evaluation in stratified disjunctive theories
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Data & Knowledge Engineering
Positive Unit Hyperresolution Tableaux and Their Application to Minimal Model Generation
Journal of Automated Reasoning
Progress Report on the Disjunctive Deductive Database System dlv
FQAS '98 Proceedings of the Third International Conference on Flexible Query Answering Systems
JELIA '96 Proceedings of the European Workshop on Logics in Artificial Intelligence
Generalized Query Answering in Disjunctive Deductive Databases: Procedural and Non-Monotonic Aspects
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
Goal-Directed Query Processing in Disjunctive Logic Databases
PLILPS '95 Proceedings of the 7th International Symposium on Programming Languages: Implementations, Logics and Programs
Minimal Model Generation with Positive Unit Hyper-Resolution Tableaux
TABLEAUX '96 Proceedings of the 5th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
A Tableau Calculus for Minimal Model Reasoning
TABLEAUX '96 Proceedings of the 5th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
Hyper Tableau - The Next Generation
TABLEAUX '98 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
On Indefinite Databases and the Closed World Assumption
Proceedings of the 6th Conference on Automated Deduction
SATCHMO: A Theorem Prover Implemented in Prolog
Proceedings of the 9th International Conference on Automated Deduction
Non-Horn Magic Sets to Incorporate Top-down Inference into Bottom-up Theorem Proving
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
On the Relationship Between Non-Horn Magic Sets and Relevancy Testing
CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
FDPLL - A First Order Davis-Putnam-Longeman-Loveland Procedure
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
DCTP - A Disconnection Calculus Theorem Prover - System Abstract
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Cooperation between top-down and bottom-up theorem provers
Journal of Artificial Intelligence Research
A relevance restriction strategy for automated deduction
Artificial Intelligence
SATCHMOREBID: SATCHMO(RE) with BIDirectional relevancy
New Generation Computing
On the rewriting and efficient computation of bound disjunctive datalog queries
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Optimization of bound disjunctive queries with constraints
Theory and Practice of Logic Programming
Query Compilation under the disjunctive well-founded semantics
Fundamenta Informaticae
Complexity results for answer set programming with bounded predicate arities and implications
Annals of Mathematics and Artificial Intelligence
Computing Only Minimal Answers in Disjunctive Deductive Databases
Journal of Automated Reasoning
Query Compilation under the disjunctive well-founded semantics
Fundamenta Informaticae
Hi-index | 0.00 |
Bottom-up query-answering procedures tend to explore a much larger search space than what is strictly needed. Top-down processing methods use the query to perform a more focused search that can result in more efficient query answering. Given a disjunctive deductive database, iDB, and a query, iQ, we establish a strong connection between model generation and clause derivability in two different representations of iDB and iQ. This allows us to use a bottom-up procedure for evaluating iQ against iDB in a top-down fashion. The approach requires no extensive rewriting of the input theory and introduces no new predicates. Rather, it is based on a certain iduality principle for interpreting logical connectives. The duality transformation is achieved by reversing the direction of implication arrows in the clauses representing both the theory and the negation of the query. The application of a generic bottom-up procedure to the transformed clause set results in top-down query answering. Under favorable conditions efficiency gains are substantial, as shown by our preliminary testing. We give the logical meaning of the duality transformation and point to the conditions and sources of improved efficiency. We show how the duality approach can be used for irefined query answering by specifying the iminimal conditions (weakest updates) to iDB under which iQ becomes derivable. This is shown to be useful for view updates in disjunctive deductive databases as well as for other interesting applications.