Depth-first iterative-deepening: an optimal admissible tree search
Artificial Intelligence
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
A Prolog technology theorem prover: implementation by an extended Prolog computer
Journal of Automated Reasoning
Quantitative results concerning the utility of explanation-based learning
Artificial Intelligence
Information Filtering: Selection Mechanisms in Learning Systems
Machine Learning
SETHEO: a high-performance theorem prover
Journal of Automated Reasoning
First-order logic and automated theorem proving (2nd ed.)
First-order logic and automated theorem proving (2nd ed.)
On the reconstruction of proofs in distributed theorem proving: a modified clause-diffusion method
Journal of Symbolic Computation - Special issue on parallel symbolic computation
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
Mechanical Theorem-Proving by Model Elimination
Journal of the ACM (JACM)
The Use of Lemmas in the Model Elimination Procedure
Journal of Automated Reasoning
Journal of Automated Reasoning
SETHEO and E-SETHEO - The CADE-13 Systems
Journal of Automated Reasoning
The Results - of the CADE-13 ATP System Competition
Journal of Automated Reasoning
Journal of Automated Reasoning
Lemma Generation for Model Elimination by Combining Top-Down and Bottom-Up Inference
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Coupling Saturation-Based Provers by Exchanging Positive/Negative Information
RTA '98 Proceedings of the 9th International Conference on Rewriting Techniques and Applications
Goal Oriented Equational Theorem Proving Using Team Work
KI '94 Proceedings of the 18th Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
Cooperation Between Top-Down and Bottom-Up Theorem Provers by Subgoal Clause Transfer
AISC '98 Proceedings of the International Conference on Artificial Intelligence and Symbolic Computation
Caching and Lemmaizing in Model Elimination Theorem Provers
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
DELTA - A Bottom-up Preprocessor for Top-Down Theorem Provers - System Abstract
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
Lemma Matching for a PTTP-based Top-down Theorem Prover
CADE-14 Proceedings of the 14th 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
System Description: Similarity-Based Lemma Generation for Model Elimination
CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
Flexible Proof-Replay with Heuristics
EPIA '97 Proceedings of the 8th Portuguese Conference on Artificial Intelligence: Progress in Artificial Intelligence
Optimizing Proof Search in Model Elimination
CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
Enhancing Conventional Search Systems with Multi-Agent Techniques: A Case Study
ICMAS '98 Proceedings of the 3rd International Conference on Multi Agent Systems
Automated theorem proving: A logical basis (Fundamental studies in computer science)
Automated theorem proving: A logical basis (Fundamental studies in computer science)
High performance ATP systems by combining several AI methods
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
The Clause-Diffusion Methodology For Distributed Deduction
Fundamenta Informaticae
Duality for Goal-Driven Query Processing in Disjunctive Deductive Databases
Journal of Automated Reasoning
Hi-index | 0.00 |
Top-down and bottom-up theorem proving approaches each have specific advantages and disadvantages. Bottom-up provers profit from strong redundancy control but suffer from the lack of goal-orientation, whereas top-down provers are goal-oriented but often have weak calculi when their proof lengths are considered. In order to integrate both approaches, we try to achieve cooperation between a top-down and a bottom-up prover in two different ways: The first technique aims at supporting a bottom-up with a top-down prover. A top-down prover generates subgoal clauses, they are then processed by a bottom-up prover. The second technique deals with the use of bottom-up generated lemmas in a top-down prover. We apply our concept to the areas of model elimination and superposition. We discuss the ability of our techniques to shorten proofs as well as to reorder the search space in an appropriate manner. Furthermore, in order to identify subgoal clauses and lemmas which are actually relevant for the proof task, we develop methods for a relevancy-based filtering. Experiments with the provers SETHEO and SPASS performed in the problem library TPTP reveal the high potential of our cooperation approaches.