1979•International Joint Conference on Artificial IntelligenceRequires access

An automatic theorem prover generating a proof in natural language

Masakazu Nakanlshi, Morio Nagata, K. Ueda

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.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Automated theorem proving, Gas meter prover, Structural proof theory, Computer-assisted proof, Computer science, Proof assistant, Proof theory, Traverse