Interpolation Theorems for Resolution in Lower Predicate Calculus

Journal of the ACM (JACM)

Volumn 17, Issue 3, 1970, Pages 535-542

  Slagle, James R ^a  

^a Public Health Service Bethesda ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; AUTOMATA THEORY; AUTOMATIC THEOREM PROVING; CONSEQUENCE FINDING; DEDUCTIVE SYSTEMS; MATHEMATICS; PREDICATE CALCULUS;

EID: 0014812066     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/321592.321604     Document Type: Article

References (22)

1. Beth, Evert W. On Padoa’s method in the theory of definition. Koninkl. Ned. Akad. Wetenschap. (Amsterdam) Proc.{A}, 56 (1953), 330-339.
2. Craig, William. Linear reasoning. A new form of the Herbrand-Gentzen theorem. J. Symbolic Logic 22 (1957), 250-268.
3. Craig, William. Three uses of the Herbrand-Gentzen theorem relating model theorem to proof theorem. J. Symbolic Logic 22 (1957), 269-285.
4. Darlington, Jared L. Automatic theorem proving with equality substitutions and mathematical induction. In Machine Intelligence, Vol. 3, Michie, D. (Ed.), Oliver and Boyd, Edinburgh, 1968, 113-127.
5. Gödel, Kurt. Die Vollstandigbert der Axiome des Logischen Vunktionen Kalkuls. Monatsh. Math. Phys. 37 (1930), 349-360. (Eng. transl. in Ref. [20].)
6. Green, C. Cordell, and Raphael, Bertram. The use of theorem-proving techniques in question-answering systems. Proc. 23rd Nat. Conf. ACM, 1968, ACM Pub. P-68, pp. 169-181 (Brandon/Systems Press, Inc., Princeton, N. J., 1968).
7. Guard, J. The arbitrarily-large entities in man-machine mathematics. In Formal Systems and Non-numerical Problem Solving by Computers, Mesarovic, Mihajlo D., and Banerji, Ranan B. (Eds.) (in press).
8. Kleene, Stephen Cole. Mathematical Logic. Wiley, New York, 1967.
9. Lee, Richard Chartung. A completeness theorem and a computer program for finding theorems derivable from given axioms. Ph.D. diss. in eng., U. of California, Berkeley, Calif., 1967.
10. Meltzer, Bernard. Theorem proving for computers: Some results on resolution and renaming. Computer J. 8 (1966), 341-343.
11. Robinson, Abraham. A result on consistency and its application to the theory of definition. Koninkl. Ned. Akad. Wetenschap. (Amsterdam) Proc. {A}, 59 (1956), 47-58.
12. Robinson, George, and Wos, Lawrence. Paramodulation and theorem proving in first order series with equality. In Machine Intelligence, Vol. 4, Meltzer, B., and Michie, D. (Eds.), American Elsevier, New York, 1968, pp. 135-150.
13. Robinson, J. A. A machine-oriented logic based on the resolution principle. J. ACM 12, 1 (Jan. 1965), 23-41.
14. Robinson, J. A. Automatic deduction with hyper-resolution. Internat. J. of Computer Math. 1(1965), 227-234.
15. Robinson, J. A. A review of automatic theorem-proving. In Proc. Symposia in Appl. Math. (1966), Vol. 19, Amer. Math. Soc., Providence, R. I., 1967, pp. 1-18.
16. Robinson, J. A. Present state of mathematical theorem proving. In Formal Systems and Non-numerical Problem Solving by Computers, Mesarovic, Mihajlo D., and Banerji, Ranan B. (Eds.) (in press).
17. Slagle, James. Automatic theorem proving with renamable and semantic resolution. J. ACM 14, 4 (Oct. 1967), 687-697.
18. Slagle, James. Heuristics search program. In Formal Systems and Non-numerical Problem Solving by Computers, Mesarovic, Mihajlo D., and Banerji, Ranan B. (Eds.) (in press).
19. Slagle, James, Chang, C. L., and Lee, R. C. T. Completeness theorems for semantic resolution for consequence-finding. Div. of Computer Res. and Technol., National Institutes of Health, Bethesda, Md., 1969.
20. Van Heijenoort, Jean (Ed.). From Frege to Gödel, a Source Book in Mathematical Logic, 1879-1931. Harvard U. Prep., Cambridge, Mass., 1967.
21. Wos, Lawrence, Carson, Daniel, and Robinson, G. The unit preference strategy in theorem proving. Proc. AFIPS 1964 Fall Joint Comp. Conf., Vol. 26, Pt. 1, pp. 615-621 (Spartan Books, Baltimore, Md.).
22. Wos, Lawrence, Carson, Daniel, and Robinson, G., Robinson, George A., and Carson, Daniel F. Efficiency and completeness of the set of support strategy in theorem proving. J. ACM 12, 4 (Oct. 1965), 536-541.