Abstract Proof Checking: An Example Motivated by an Incompleteness Theorem

Authors:
Alan Bundy;Fausto Giunchiglia;Adolfo Villafiorita;Toby Walsh
Affiliations:
Mathematical Reasoning Group, Dept. of Ai, University of Edinburgh, U.K.;Istituto Ricerca Scientifica e Tecnologica (irst) Disa, University of Trento;Istituto di Informatica, University of Ancona Mechanized Reasoning Group, Dist, University of Genoa, Italy;Istituto Ricerca Scientifica e Tecnologica (irst) Mechanized Reasoning Group, Dist, University of Genoa, Italy
Venue:
Journal of Automated Reasoning
Year:
1997

Citing 7
Cited 2

Planning as search: a quantitative approach

Artificial Intelligence
Automated proofs of Lo¨b's theorem and Go¨del's two incompleteness theorems

Journal of Automated Reasoning
Theorem proving with definitions

Proceedings of the Seventh Conference (AISB89) on Artificial Intelligence and Simulation of Behaviour
Tree subsumption: reasoning with outlines

ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
A theory of abstraction

Artificial Intelligence
Automatically generating abstractions for planning

Artificial Intelligence
Proof-checking metamathematics (theorem-proving)

Proof-checking metamathematics (theorem-proving)

Compositional verification of knowledge-based task models and problem-solving methods

Knowledge and Information Systems
Strategic Issues, Problems and Challenges in Inductive Theorem Proving

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We demonstrate the use of abstraction in aiding the construction of aninteresting and difficult example in a proof-checking system. Thisexperiment demonstrates that abstraction can make proofs easier tocomprehend and to verify mechanically. To support such proof checking, wehave developed a formal theory of abstraction and added facilities for usingabstraction to the GETFOL proof-checking system.