An Automatic Theorem Prover Generating a Proof in Natural Language
Abstract
An automatic theorem prover which displays a proof in natural language is described. This system proves properties of recursive programs, and constructs a proof tree corresponding to the proof. Then it translates the tree into the proof text in English by means of the tree traverse. The proof written by this system is easy to read, because the English text is placed Instead of notations of logics, and some redundant and trivial statements are disappeared.
Cite
Text
Nakanlshi et al. "An Automatic Theorem Prover Generating a Proof in Natural Language." International Joint Conference on Artificial Intelligence, 1979.Markdown
[Nakanlshi et al. "An Automatic Theorem Prover Generating a Proof in Natural Language." International Joint Conference on Artificial Intelligence, 1979.](https://mlanthology.org/ijcai/1979/nakanlshi1979ijcai-automatic/)BibTeX
@inproceedings{nakanlshi1979ijcai-automatic,
title = {{An Automatic Theorem Prover Generating a Proof in Natural Language}},
author = {Nakanlshi, Masakazu and Nagata, Morio and Ueda, Kenji},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {1979},
pages = {636-638},
url = {https://mlanthology.org/ijcai/1979/nakanlshi1979ijcai-automatic/}
}