Checking Textbook Proofs

Checking Textbook Proofs (1998)

Cached

Download Links

by Claus Zinn

Venue:

Int. Workshop on FirstOrder Theorem Proving (FTP'98), Technical Report E1852-GS-981

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Checking Textbook Proofs	user correction - Legacy Corrections
AUTHOR NAME	Claus Zinn	SVM HeaderParse 0.1
AUTHOR AFFIL	Lehrstuhl fur Kunstliche Intelligenz (IMMD VIII); Universitat Erlangen-Nurnberg	SVM HeaderParse 0.2
AUTHOR ADDR	Am Weichelgarten 9, 91058 Erlangen, Germany	SVM HeaderParse 0.1
ABSTRACT	. Our long-range goal is to implement a program for the machine verification of textbook proofs. We study the task from both the linguistics and deduction perspective and give an in-depth analysis for a sample textbook proof. A three phase model for proof understanding is developed: parsing, structuring and refining. It shows that the combined application of techniques from both NLP and AR is quite successful. Moreover, it allows to uncover interesting insights that might initiate progress in both AI disciplines. Keywords: automated reasoning, natural language processing, discourse analysis 1 Introduction In [12], John McCarthy notes that "Checking mathematical proofs is potentially one of the most interesting and useful applications of automatic computers". In the first half of the 1960s, one of his students, namely Paul Abrahams, implemented a Lisp program for the machine verification of mathematical proofs [1]. The program, named Proofchecker, "was primarily directed towar...	user correction - Legacy Corrections
YEAR	1998	INFERENCE
VENUE	Int. Workshop on FirstOrder Theorem Proving (FTP'98), Technical Report E1852-GS-981	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	262--264	INFERENCE
CITATIONS	22 found	ParsCit 1.0