A Prolog technology theorem prover: implementation by an extended Prolog computer
Journal of Automated Reasoning
Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
Genetic programming: on the programming of computers by means of natural selection
Genetic programming: on the programming of computers by means of natural selection
The Use of Lemmas in the Model Elimination Procedure
Journal of Automated Reasoning
SETHEO and E-SETHEO - The CADE-13 Systems
Journal of Automated Reasoning
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
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
Lemma Generalization and Non-unit Lemma Matching for Model Elimination
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
On the Use of Subgoal Clauses in Bottom-up and Top-down Calculi
Fundamenta Informaticae
| Hi-index | 0.00 |
A very promising approach for integrating top-down and bottom-up proof search is the use of bottom-up generated lemmas in top-down provers. When generating lemmas, however) the currently used lemma generation procedures suffer from the well-known problems of forward reasoning methods, e.g., the proof goal is ignored. In order to overcome these problems we propose two relevancy-based lemma generation methods for top-down provers. The first approach employs a bottom-up level saturation procedure controlled by top-down generated patterns which represent promising subgoals. The second approach uses evolutionary search and provides a self-adaptive control of lemma generation and goal decomposition.