Download PDFOpen PDF in browser

Robust, Semi-Intelligible Isabelle Proofs from ATP Proofs

16 pagesPublished: May 26, 2013

Abstract

Sledgehammer integrates external automatic theorem provers (ATPs) in the Isabelle/HOL proof assistant. To guard against bugs, ATP proofs must be reconstructed in Isabelle. Reconstructing complex proofs involves translating them to detailed Isabelle proof texts, using suitable proof methods to justify the inferences. This has been attempted before with little success, but we have addressed the main issues: Sledgehammer now transforms the proofs by contradiction into direct proofs (as described in a companion paper); it reconstructs skolemization inferences; it provides the right amount of type annotations to ensure formulas are parsed correctly without overwhelming them with types; and it iteratively tests and compresses the output, resulting in simpler and faster proofs.

Keyphrases: automatic theorem provers, higher-order logic, Isabelle/HOL, proof assistants, simple type theory, Skolemization, Sledgehammer, structured proofs

In: Jasmin Christian Blanchette and Josef Urban (editors). PxTP 2013. Third International Workshop on Proof Exchange for Theorem Proving, vol 14, pages 117--132

Links:
BibTeX entry
@inproceedings{PxTP2013:Robust_Semi_Intelligible_Isabelle_Proofs,
  author    = {Steffen Juilf Smolka and Jasmin Christian Blanchette},
  title     = {Robust, Semi-Intelligible Isabelle Proofs from ATP Proofs},
  booktitle = {PxTP 2013. Third International Workshop on Proof Exchange for Theorem Proving},
  editor    = {Jasmin Christian Blanchette and Josef Urban},
  series    = {EPiC Series in Computing},
  volume    = {14},
  pages     = {117--132},
  year      = {2013},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {https://easychair.org/publications/paper/GT},
  doi       = {10.29007/zbdb}}

The requested page was not found on this server.

Download PDFOpen PDF in browser