Proceedings

A Semantically Guided Deductive System for Automatic Theorem-Proving

Download BibTeX Cite

Proceedings of the Third International Joint Conference on Artificial Intelligence. Theorem Proving and Logic: 1. Pages 41-45.

© 1973 International Joint Conferences on Artificial Intelligence

Abstract

This paper presents a semantic and deductive formal system for automatic theorem-proving. The system has, as its deductive component, a form of natural deduction. Its semantic component relies on an underlying representation of a model. This model is invoked to prune subgoals generated by the deductive component, whenever such subgoals test false in the model. In addition, the model is used to suggest inferences to be made at the deductive level. Conversely, the current state of the proof suggests changes to be made to the model, e.g. when a construction is required as in geometry. The system is seen to possess a very smooth and transparent interface between its semantics and deductive syntax. These semantic and syntactic subsystems interact continuously during the search for a proof, each suggesting to the other how next to proceed. Particularly appealing is the naturalness of the system from a human point of view.

  1. Andrews, P,B, Resolution with merging, J,ACM, ~ (1968)' 367-381.
  2. Bledsoe, W,W, Splitting and reduction heuristics in automatic theorem proving. Artificial Intelligence, l (1971), 55-77.
  3. Bledsoe, W.W., Boyer, R,S, and Henneman, W,H, Computer proofs of limit theorems, Artificial Intelligence, l• (1972), 27-60. IJCAI
  4. Davis, M, and Put~am, H. A computing procedure for quantification theory, J,ACM, 2 (1960), 201-215,
  5. Gelernter, H. Realization of a geometry theorem- proving machine. Computers and Thought (eds. Feigenbaum, E,A, and Feldman, J,) New York: McGraw-Hill (1963), 134-152.
  6. Gelernter, H., Hansen, J.R,, and Loveland, D,W, Empirical explorations of the geometry theorem machine. Computers and Thought (eds, Feigenbaum, E.A. and Feldman, J.) New York: McGraw-Hill (1963) 153-163.
  7. Loveland, D,W, A linear format for resolution. symposium ort Automatic Demon@tration (ed, Laudet, ~1.) New York: Springer- Verlag (1970),
  8. Nevins, A.J. A human oriented logic for automatic theorem proving, MIT A.I. Laboratory Memo No,268 (Oct.l972),
  9. Norton, L,M, Experiments with a heuristic theorem- proving program for predicate calculus wi~h equality, Artificial Intelligence, 2 (1971), 261-284, 10, Reiter, R, The use of models in automatic theorem proving. University of British Columbia, Dept. of Computer Science Technical Report 72-09 (Sept, 1972), 11, Robinson, J.A. A machine oriented logic based on the resolution principle, J.A~, 12 (1965)' 23-41. --- 12, Slagle, J,R, Automatic theorem proving with renamable and semantic resolution, J,ACM 14 (1967), 687-697.
  10. Wang, H. Toward mechanical mathematics, IBM J. Res, Dev, ~ (1960), 2-22,
  11. Wos, L., Robinson, G.A •• and Carson, D.F. The concept of demodulation in theorem proving. J.ACM, 14 (1967), 698-709,

References were extracted automatically from the PDF and may contain errors.

Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards