Automatic Theorem Proving with Built-in Theories Including Equality, Partial Ordering, and Sets

Journal of the ACM (JACM)

Volumn 19, Issue 1, 1972, Pages 120-135

  Slagle, James R ^a  

^a NATIONAL INSTITUTES OF HEALTH   (United States)

Author keywords

artificial intelligence; built in theories; deduction; inference rules; mathematical logic; paramodulation; partial ordering; refutation completeness; resolution principle; set theory; theorem proving; theories with equality

Indexed keywords

ARTIFICIAL INTELLIGENCE; THEOREM PROVING;

AUTOMATA THEORY;

EID: 0015282299     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/321679.321689     Document Type: Article

References (21)

1. Allen, J., and Luckham, D. An interactive theorem-proving program. Machine Intelligence 5, B. Meltzer and D. Michie, Eds., American Elsevier, New York, 1970, pp. 321-336.
2. Anderson, R. Completeness results for E-resolution. Proc. of the AFIPS 1970 SJCC, pp. 653-656.
3. Chang, C. L. Renamable paramodulation for automatic theorem proving with equality. Artif. Intel. 1 (1970), 247-256.
4. Darlington, J. Theorem provers as question answerers. Proc. of the International Joint Conference on Artificial Intelligence, 1969, D. Walker and L. Norton, Eds.
5. Davis, M., and Putnam, H. A computing procedure for quantification theory. J.ACM 7 (July 1960), 201-215.
6. Gilmore, P. A proof method for quantification theory: Its justification and realization. IBM J. Res. Dev. 4 (Jan. 1960), 28-35.
7. Green, C., and Raphael, B. The use of theorem proving techniques in question-answering systems. Proc. of the 23rd ACM National Conference, 1969. Thompson Book Co., Washington, D.C., 1969, pp. 169-181.
8. Kowalski, R. The case for using axioms in automatic demonstrations. Symposium on Automatic Demonstration (Lecture Notes in Mathematics, Vol. 125). Springer-Verlag, New York, 1970, pp. 112-127.
9. Kowalski, R., and Hayes, P. Semantic trees in automatic theorem proving. Machine Intelligence 4, B. Meltzer and D. Michie, Eds., American Elsevier, New York, 1969, pp. 87-101.
10. McCarthy, J. Programs with common sense. Proc. of the Symposium on the Mechanization of Thought Processes. Her Majesty's Stationery Office, London, 1959, pp. 75-84.
11. Mendelson, E. Introduction to Mathematical Logic. Van Nostrand, Princeton, N.J., 1964.
12. Robinson, G., and Wos, L. Paramodulation and theorem proving in first order theories with equality. Machine Intelligence 4, B. Meltzer and D. Michie, Eds., American Elsevier, New York, 1969, pp. 135-150.
13. Robinson, J. A. A machine oriented logic based on the resolution principle. J.ACM 12 (Jan. 1965), 23-41.
14. Robinson, J. A. A review of automatic theorem proving. Proc. of the Symposia in Applied Mathematics, Vol. 19. American Mathematical Society, Providence, R.I., 1967, pp. 1-18.
15. Slagle, J. R. Artificial Intelligence: The Heuristic Programming Approach. McGraw-Hill, New York, 1971.
16. Slagle, J. R. Automatic theorem proving with renamable and semantic resolution. J.ACM 14 (Oct. 1967), 687-697.
17. Slagle, J. R. Interpolation theorems for resolution in lower predicate calculus. J.ACM 17 (July 1970), 535-542.
18. Wang, H. Formalization and automatic theorem proving. Information Processing 1965 (Proc. of the IFIP Congress 66), Vol. 1, W. Kalenich, Ed., Spartan Books, Washington, D.C., 1965, pp. 51-58.
19. Wos, L., Carson, D., and Robinson, G. The unit preference strategy in theorem proving. Proc. of the AFIPS 1964 FJCC, pp. 616-621.
20. Wos, L., Robinson, G., and Carson, D. Efficiency and completeness of the set of support strategy in theorem proving. J.ACM 12 (Oct. 1965), 536-541.
21. Wos, L., and Robinson, G. Maximal models and refutation completeness: Semidecision procedures in automatic theorem proving. In Word Problems in Group Theory: The Burnside Problem and Decision Problems, W. W. Boone, F. B. Cannonito, and R. C. Lyndon, Eds., North-Holland Pub. Co., Amsterdam, 1971.