A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
Efficiency and Completeness of the Set of Support Strategy in Theorem Proving
Journal of the ACM (JACM)
Automatic Theorem Proving With Renamable and Semantic Resolution
Journal of the ACM (JACM)
Mechanical Theorem-Proving by Model Elimination
Journal of the ACM (JACM)
A Simplified Format for the Model Elimination Theorem-Proving Procedure
Journal of the ACM (JACM)
A Human Oriented Logic for Automatic Theorem-Proving
Journal of the ACM (JACM)
Symbolic Logic and Mechanical Theorem Proving
Symbolic Logic and Mechanical Theorem Proving
Experiments with a resolution-based deductive question-answering system and a proposed clause representation for parallel search.
The unit preference strategy in theorem proving
AFIPS '64 (Fall, part I) Proceedings of the October 27-29, 1964, fall joint computer conference, part I
The Q* algorithm: a search strategy for a deductive question-answering system
IJCAI'73 Proceedings of the 3rd international joint conference on Artificial intelligence
Introduction Tutorial on Resolution
IEEE Transactions on Computers
| Hi-index | 14.99 |
In, this paper we argue that if search procedures are to use problem-specific information to direct a search, then they must have complete control over the deductive process. This includes the freedom to select any pair of clauses to interact as well as the freedom to select the literals upon which to attempt the interaction. We give examples to indicate the nature of inference rules which are incompatible with such search procedures. We then present a framework for a search procedure to indicate where problem-specific information may be utilized. Finally, we augment the search procedure to prevent the generation of certain redundant inferences. The augmentation makes use of lemmas to avoid replicating deduction sequences in solving multiple instances of the same subproblem at distinct places in the search space.