A computational logic handbook
A computational logic handbook
A Prolog technology theorem prover: implementation by an extended Prolog computer
Journal of Automated Reasoning
Non-horn clause logic programming without contrapositives
Journal of Automated Reasoning
A Prolog technology theorem prover: a new exposition and implementation in Prolog
Theoretical Computer Science - Selected papers on theoretical issues of design and implementation of symbolic computation systems
An Implementation of the Model Elimination Proof Procedure
Journal of the ACM (JACM)
The Use of Lemmas in the Model Elimination Procedure
Journal of Automated Reasoning
The CADE-14 ATP System Competition
Journal of Automated Reasoning
SETHEO and E-SETHEO - The CADE-13 Systems
Journal of Automated Reasoning
Explanation-Based Generalization: A Unifying View
Machine Learning
SATCHMO: A Theorem Prover Implemented in Prolog
Proceedings of the 9th International Conference on Automated Deduction
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
Lemma Matching for a PTTP-based Top-down Theorem Prover
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
SETHEO V3.2: Recent Developments - System Abstract
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
Automated theorem proving: A logical basis (Fundamental studies in computer science)
Automated theorem proving: A logical basis (Fundamental studies in computer science)
Lemma generation for model elimination by combining top-down and bottom-up inference
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
| Hi-index | 0.00 |
In this paper, we study two lemma methods for accelerating Loveland's model elimination calculus: One is lemma generalization and another is non-unit lemma matching. The derivation of lemmas in this paper is a dynamic one, i.e., lemma generation is repeatedly performed during an entire refutation search process. A derived lemma is immediately generalized by investigating the obtained subproof of the lemma. The lemma generalization increases the possibility of successful applications of the lemma matching rule. The non-unit lemma matching is an extension of the previously proposed unit lemma matching, and has the ability for stably speeding up model elimination calculus by monotonically reducing the refutation search space. We have implemented a PTTP-based theorem prover, named I-THOP, which performs unit lemma generalization and 2-literal non-unit lemma matching. We report good experimental results obtained with I-THOP.