Experiment with an Automatic Theorem-Prover Having Partial Ordering Inference Rules

Communications of the ACM

Volumn 16, Issue 11, 1973, Pages 682-688

  Slagle, James R ^a   Norton, Lewis M ^a  

^a NATIONAL INSTITUTES OF HEALTH   (United States)

Author keywords

heuristics; hyper resolution; inference rules; P1 resolution; paramodulation; partial ordering; resolution; theorem proving

Indexed keywords

INFERENCE RULES;

COMPUTER PROGRAMMING;

EID: 0015681523     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/355611.362538     Document Type: Article

References (11)

1. Boyer, B.A. Locking: A restriction of resolution. Ph.D. Th., U. of Texas at Austin, Aug. 1971.
2. Hoare, C.A.R. Proof of a program: FIND. Comm. ACM 14, 1 (Jan. 1971), 39-45.
3. Kowalski, R., and Hayes, P.J. Semantic trees in automatic theorem-proving. In Machine Intelligence 4, B. Meltzer and D. Michie (Eds), Edinburgh U. Press, Edinburgh, 1969, pp. 87-101.
4. Norton, L.M. Experiments with a heuristic theorem-proving program for predicate calculus with equality. Artif. Intel. 2 (1971), 261-284.
5. Reiter, R. Two results on ordering for resolution with merging and linear format. J. ACM 18, 4 (Oct. 1971), 630-646.
6. Robinson, G.A., and Wos, L. Paramodulation and theoremproving in first-order theories with equality. In Machine Intelligence B. Meltzer and D. Michie (Eds.), Edinburgh U. Press, Edinburgh, 1969, pp. 135-150.
7. Robinson, J.A. Automatic deduction with hyper-resolution. Int. J. Comp. Math. 1 (1965), 227-234.
8. Slagle, J.R. Automatic theorem proving with built-in theories including equality, partial ordering and sets. J. ACM 19, 1 (Jan. 1972), 120-135.
9. Slagle, J.R., Chang, C.L., and Lee, R.C.T. Completeness theorems for semantic resolution in consequence-finding. In Proc. Int. Joint Conf. on Artif. Intel., D.E. Walker and L.M. Norton (Eds.), 1969, pp. 281-285.
10. Wos, L. Robinson, G.A., and Carson, D.F. Efficiency and completeness of the set of support strategy in theorem proving. J. ACM 12, 4 (Oct. 1965), 536-541.
11. Counterexamples and conjectures. ACM SIGART Newsletter, No. 30 (Oct. 1971), 5-7.