Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity

Journal of the ACM (JACM)

Volumn 21, Issue 4, 1974, Pages 622-642

  Slagle, James R ^a  

^a NATIONAL INSTITUTES OF HEALTH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER METATHEORY;

EID: 0016115108     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/321850.321859     Document Type: Article

References (15)

1. Allen, J., and Luckham, D. An interactive theorem-proving program. In Machine Intelligence 5, B. Meitzer and D. Michie, Eds., American Elsevier, New York, 1970, pp. 321-336.
2. Darlington, J. Automatic theorem proving with equality substitutions and mathematical induction. In Machine Intelligence 3, D. Michie, Ed., Oliver and Boyd, Edinburgh, 1968, pp. 113-127.
3. Guard, J., Oglesby, F., Bennett, J., and Settle, L. Semi-automated mathematics. J. ACM 16, 1 (Jan. 1969), 49-62.
4. Kowalski, R., and Hayes, P. Semantic trees in automatic theorem-proving. In Machine Intelligence 4, B. Meltzer and D. Michie, Eds., American Elsevier, New York, 1969, pp. 87-101.
5. Plotkin, G. Building in equational theories. In Machine Intelligence 7, B. Meltzer and D. Michie, Eds., Halsted Press, New York, 1973, pp. 73-90.
6. Robinson, G., and Wos, L. Paramodulation and theorem-proving in first order theories with equality. In Machine Intelligence 4, B. Meltzer and D. Michie, Eds., American Elsevier, New York, 1969, pp. 135-150.
7. Robinson, J. A. A review of automatic theorem proving. Proc. Symposia in Applied Mathematics, Vol. 19, Amer. Math. Soc., Providence, R.I., 1967, pp. 1-18.
8. Slagle, J. An approach for finding C-linear complete inference systems. J. ACM 19, 3 (July 1972), 496-516.
9. Slagle, J. Artificial Intelligence: The Heuristic Programming Approach. McGraw-Hill, New York, 1971. (Also available in Japanese and German translations.)
10. Slagle, J. Automatic theorem proving with built-in theories including equality, partial ordering, and sets. J. ACM 19, 1 (Jan. 1972), 120-135.
11. Slagle, J., and Norton, L. Automated theorem-proving for the theories of partial and total ordering. Computer J. (to appear).
12. Slagle, J., and Norton, L. Experiments with an automatic theorem-prover having partial ordering inference rules. Comm. ACM 16, 11 (Nov. 1973), 682-688.
13. Wos, L., Carson, D., and Robinson, G. The unit preference strategy in theorem proving. Proc. AFIPS 1964 FJCC, Vol. 26, pp. 615-621.
14. Wos, L., Robinson, G., and Carson, D. Efficiency and completeness of the set of support strategy in theorem proving. J. ACM 12, 4 (Oct. 1965), 536-541.
15. Wos, L., Robinson, G., Carson, D., and Shalla, L. The concept of demodulation in theorem proving. J. ACM 14, 4 (Oct. 1967), 698-709.