The use of lemmas in the Model Elimination procedure

Journal of Automated Reasoning

Volumn 19, Issue 1, 1997, Pages 117-141

  Astrachan, O L ^a   Loveland, D W ^a  

^a Duke University   (United States)

Author keywords

Lemma; METEOR; Model elimination

Indexed keywords

PROBLEM SOLVING; THEOREM PROVING;

LEMMAS; MODEL ELIMINATION (ME) PROCEDURE;

ARTIFICIAL INTELLIGENCE;

EID: 0031211501     PISSN: 01687433     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1005770705587     Document Type: Article

References (29)

1. Ahit-Kaci, H.: Warren's Abstract Machine: A Tutorial Reconstruction, MIT Press, 1991.
2. Astrachan, O. L. Investigations in Model Elimination Based Theorem Proving, Ph.D. thesis, Duke University, 1992 (also technical report CS-1992-21).
3. Astrachan, O. L.: METEOR: Exploring model elimination theorem proving, Journal of Automated Reasoning 13(2) (1994), 283-296.
4. Astrachan, O. L. and Loveland, D. W.: METEORs: High performance theorem provers using model elimination, in R. S. Boyer (ed.), Automated Reasoning: Essays in Honor of Woody Bledsoe, Kluwer Academic Publishers, 1991.
5. Astrachan, O. L., and Stickel, M. E.: Caching and lemmaizing in model elimination theorem provers, in Deepak Kapur (ed.), Proceedings of the Eleventh International Conference on Automated Deduction, Springer-Verlag, 1992.
6. Bledsoe, W. W.: Challenge problems in elementary calculus, Journal of Automated Reasoning 6(3) (1990), 341-359.
7. Bledsoe, W. W., Boyer, R., and Henneman, W.: Computer proofs of limit theorems, Artificial Intelligence 3 (1972), 27-60.
8. Bledsoe, W. W. and Hines, L.: Variable elimination and chaining in a resolution-based prover for inequalities, in Proceedings of the Fifth Conference on Automated Deduction, Springer-Verlag, 1980, pp. 281-292.
9. Bose, S., Clarke, E., Long, D. E., and Michaylov, S.: PARTHENON: A parallel theorem prover for non-Horn clauses, Journal of Automated Reasoning 8(2) (1992), 153-181.
10. Chang, C. and Lee, R.: Symbolic Logic and Mechanical Theorem Proving, Academic Press, 1973.
11. Chu, H., and Plaisted, D. A.: Semantically guided first-order theorem proving using Hyperlinking, in A. Bundy (ed.), Proceedings of the Twelfth Conference on Automated Deduction, Lecture Notes in Artificial Intelligence 814, Springer-Verlag, Berlin, June 1994, pp. 192-238.
12. Digricoli, V. J.: The Rue theorem-proving system: the complete set of LIM+challenge problems, Journal of Automated Reasoning 12 (1994), 241-264.
13. Digricoli, V. J. and Kochendorfer, E.: Lim+challenge problems by RUE hyper-resolution, in Deepak Kapur (ed.), Proceedings of the Eleventh International Conference on Automated Deduction, Springer-Verlag, 1992, pp. 239-252.
14. Fleisig, S., Loveland, D., Smiley, A., and Yarmash, D.: An implementation of the model elimination proof procedure, Journal of the Association for Computing Machinery 21 (1974), 124-139.
15. Hines, L. M.: The central variable strategy of str+ve, in Deepak Kapur (ed.), Proceedings of the Eleventh International Conference on Automated Deduction, Springer-Verlag, 1992.
16. Letz, R., Bayerl, S., Schumann, J., and Bibel, W.: SETHEO - a high-performance theorem prover, Journal of Automated Reasoning 8 (1992), 183-212.
17. Loveland, D. W.: Mechanical theorem proving by model elimination, Journal of the Association for Computing Machinery 15(2) (1968), 236-251.
18. Loveland, D. W.: A simplified format for the model elimination procedure, Journal of the Association for Computing Machinery 16(3) (1969), 349-363.
19. Loveland, D. W.: Automated Theorem Proving: A Logical Basis, North-Holland, 1978.
20. McCune, W.: Otter 2.0, in Mark Stickel (ed.), Proceedings of the Tenth International Conference on Automated Deduction, Springer-Verlag, 1990, pp. 663-664.
21. Plaisted, D. A.: The search efficiency of theorem proving strategies, in Alan Bundy (ed.), Proceedings of the Twelfth International Conference on Automated Deduction, Springer-Verlag, 1994.
22. Robinson, J. A.: A machine-oriented logic based on the resolution principle, Journal of the Association for Computing Machinery 12(1) (1965), 23-41.
23. Schumann, J. and Letz, R.: PARTHEO: A high performance parallel theorem prover, in Proceedings of the Tenth International Conference on Automated Deduction, 1990, pp. 40-56.
24. Stickel, M. E.: A Prolog technology theorem prover: Implementation by an extended Prolog compiler, in Proceedings of the Eighth International Conference on Automated Deduction, Springer-Verlag, 1986, pp. 573-587.
25. Stickel, M. E.: A Prolog technology theorem prover: Implementation by an extended Prolog compiler, Journal of Automated Reasoning 4 (1988), 343-380.
26. Wang, H.: Formalization and automatic theorem-proving, in Proceedings of IFIP Congress 65, Washington, D.C., 1965, pp. 51-58.
27. Wang, T. C. and Bledsoe, W. W.: Hierarchical deduction, Journal of Automated Reasoning 3 (1987), 35-77.
28. Wilson, G. A. and Minker, J.: Resolution, refinements, and search strategies: A comparative study, IEEE Transactions on Computers C-25(8) (1976), 782-801.
29. Wos, L., Robinson, G. A., and Carson, D.: Efficiency and completeness of the set of support strategy in theorem proving, Journal of the Association for Computing Machinery 12 (1965).