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)
Journal of the ACM (JACM)
A Linear Format for Resolution With Merging and a New Technique for Establishing Completeness
Journal of the ACM (JACM)
Two Results on Ordering for Resolution with Merging and Linear Format
Journal of the ACM (JACM)
An Assessment of Techniques for Proving Program Correctness
ACM Computing Surveys (CSUR)
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
| Hi-index | 0.07 |
Many potential applications of mechanical theorem proving exist in such areas as question answering, robot control, program writing, proof of program correctness, verification of mathematical proofs, general problem solving, and command and control systems. Theorem-proving systems must become much more efficient before applications become generally practical, and much statistical testing will be necessary to select the strategies to be used in practical systems. This paper reports on the results of experimental testing of some major theorem-proving strategies and their interactions. Test results are based on CPU time. The paper concludes that (1) subsumption and factoring should not be used (at least, in this implementation), (2) set of support and P1-deduction should be used, (3) the choice between breadth-first searching and unit preference searching is highly problem dependent, and (4) merge and linear strategies have little effect on the proof process. No statistically significant interaction among the strategies was discovered.