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
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Query evaluation in recursive databases: bottom-up and top-down reconciled
Data & Knowledge Engineering
An efficient strategy for non-Horn deductive databases
Selected papers of the workshop on Deductive database theory
Journal of Automated Reasoning
Foundations of disjunctive logic programming
Foundations of disjunctive logic programming
Complexity aspects of various semantics for disjunctive databases
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A-SATCHMORE: SATCHMORE with availability checking
New Generation Computing
Symbolic Logic and Mechanical Theorem Proving
Symbolic Logic and Mechanical Theorem Proving
Positive Unit Hyperresolution Tableaux and Their Application to Minimal Model Generation
Journal of Automated Reasoning
Duality for Goal-Driven Query Processing in Disjunctive Deductive Databases
Journal of Automated Reasoning
I-SATCHMO: An Improvement of SATCHMO
Journal of Automated Reasoning
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
A relevance restriction strategy for automated deduction
Artificial Intelligence
UNSEARCHMO: eliminating redundant search space on backtracking for forward chaining theorem proving
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Ordered Semantic Hyper Tableaux
Journal of Automated Reasoning
R-UNSEARCHMO: A Refinement on UNSEARCHMO
PRICAI '02 Proceedings of the 7th Pacific Rim International Conference on Artificial Intelligence: Trends in Artificial Intelligence
A relevance restriction strategy for automated deduction
Artificial Intelligence
An Improvement of Herbrand's theorem and its application to model generation theorem proving
Journal of Computer Science and Technology
| Hi-index | 0.00 |
SATCHMORE was introduced as a mechanism to integrate relevancy testing with the model-generation theorem prover SATCHMO. This made it possible to avoid invoking some clauses that appear in no refutation, which was a major drawback of the SATCHMO approach. SATCHMORE relevancy, however, is driven by the entire set of negative clauses and no distinction is accorded to the query negation. Under unfavorable circumstances, such as in the presence of large amounts of negative data, this can reduce the efficiency of SATCHMORE. In this paper we introduce a further refinement of SATCHMO called SATCHMOREBID: SATCHMORE with BIDirectional relevancy. SATCHMOREBID uses only the negation of the query for relevancy determination at the start. Other negative clauses are introduced on demand and only if a refutation is not possible using the current set of negative clauses. The search for the relevant negative clauses is performed in a forward chaining mode as opposed to relevancy propagation in SATCHMORE which is based on backward chaining. SATCHMOREBID is shown to be refutationally sound and complete. Experiments on a prototype SATCHMOREBID implementation point to its potential to enhance the efficiency of the query answering process in disjunctive databases.