Proceedings

An Automatic Theorem Prover Generating a Proof in Natural Language

Download BibTeX Cite

Proceedings of the Sixth International Joint Conference on Artificial Intelligence. .

© 1979 International Joint Conferences on Artificial Intelligence

Abstract

An automatic theorem prover which displays a proof in system proves properti~s of recursive programs, and the proof. Then it translates the tree into the proof traverse. The proof written by this system is easy to instead of notations of logics, and some redundant and natural language is described. This constructs a proof tree corresponding to text in English by means of the tree read, because the English text is placed trivial statements are disappeared.

  1. Chester, D. "The proofs into English." (1976) 261-278. translation of formal ~ Intell. 7: 3
  2. King, J.C. "A program verit'ier." PhD thesis, Carnegie-Mellon Univ . , 1969.
  3. Nishimura, T. "Gentzen-type formal sys t em representing properties of functions." Comment . ~ ~ ~ Pauli. 23 : 1 (1974) 37-44 .
  4. Nishimura, T., Nakanishi, M., Nagata, M. and Iwamaru, Y. "Gentzen-type formal system representing properties of functions and its implementation." In~ IJCAI-75. Tbilisi , SeP•t 1975, pp. 57-64.
  5. Suzuki, N. "Verifying programs by alge- braic and logical reduction." In~ ~ ~ ~ Reliable Software. 1975, pp. 473-481 .

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

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