Proceedings

A Man-Machine Theorem-Proving System

Download BibTeX Cite

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

© 1973 International Joint Conferences on Artificial Intelligence

Abstract

This paper describes a man-machine theorem proving system at the University of Texas (Austin) which has been used to prove a few theorems in general topology. The theorem (or subgoal) being proved is presented on the scope in its natural form so that the user can easily comprehend it and, by a series of interactive commands, can help with the proof when he desires. A feature called DETAIL is employed which allows the human to interact only when needed and only to the extent necessary for the proof. The program is built around a modified form of IMPLY, a natural-deduction-like theorem proving technique which has been described earlier. A few examples of proofs are given.

  1. W. w. Bledsoe, R. S. Boyer, and W. H. Henneman, Computer Proofs of Limit Theorems, Artificial Intelligence 3 (1972), 27-60. IJCAI
  2. W. W. Bledsoe, Splitting and Reduction Heuristics in Automatic Theorem Proving, Artificial Inte lli gence 2 (1971), 55-77.
  3. J. R. Guard, F. C. Oglesby, J. H. Bennett, and L. G. Settle, Semi-automated Mathematics, JACM 16 (1969), 49-62.
  4. John Allen and David Luckham, An Interactive Theorem-Proving Pro gram, Mach ine Intelligence 5 (1970), 321-336.
  5. G. P. Huet, Experiments with an Interactive Prover for Logic with Equality, Report 1106, Jennings Computing Center, Case Western Reserve University.
  6. John McCarthy, Computer Progr ams for Checking Mathematical Proofs, Proc. Amer. Ma th. Soc. on Recursive function Theory, held in Ney York, April, 1961.
  7. Paul w. Abrahams, Mach ine Ve rification of Mathe- matical Proof, Doctoral Dissertation in Mathematics, MIT, May, 1963.
  8. w. w. Bledsoe and E. J. Gilbert, Automatic Theorem Proof-Checking in Set Theory: A Preliminary Report, Sandia Corp. Report SC-RR-67-525, July, 1967.
  9. Arthur J. Nevins, A Human Oriented Lo gic for Automatic Theorem Proving, MIT AI Memo No. 268, October, 1972.
  10. Raymond Reiter, The Use of Models in Automatic Theorem Proving, Dept. of Computer Science, University of British Columbia, September, 1972.
  11. TAURUS, described in Users Manual, Computation Center, University of Texas, Austin.
  12. Pe ter Bruell, A Description of the Functions of The Man-Machine Topology Theorem Prover, (under preparation).
  13. John L. Kelley, General Topology , van Nostrand, 1955.
  14. James R. Slagle, Automatic Theo rem Proving with Built-in Theories Including Equality, Partial Ordering, and Sets, JACM 19 (1972), 120-135.
  15. Robert Boyer, Locking: A Restriction on Resolution, Ph.D. Dissertation, Mathematics Dept., University of Texas, Austin, 1971.
  16. Dallas S. Lankford, Equality Atom Term Locking, Ph.D. Dissertation, Mathematics Dept., University of Texas, Austin, 1972.
  17. George Ernst, The Utility of independent subgoals in Theorem Proving, Information and Control, val. 18, 3, 1971.

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

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