Skip to Main content Skip to Navigation
Conference papers

Project Presentation: Algorithmic Structuring and Compression of Proofs (ASCOP)

Stefan Hetzl 1
1 PARSIFAL - Proof search and reasoning with logic specifications
LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau], Inria Saclay - Ile de France
Abstract : Computer-generated proofs are typically analytic, i.e. they essentially consist only of formulas which are present in the theorem that is shown. In contrast, mathematical proofs written by humans almost never are: they are highly structured due to the use of lemmas. The ASCOP-project aims at developing algorithms and software which structure and abbreviate analytic proofs by computing useful lemmas. These algorithms will be based on recent groundbreaking results establishing a new connection between proof theory and formal language theory. This connection allows the application of e cient algorithms based on formal grammars to structure and compress proofs.
Document type :
Conference papers
Complete list of metadata

Cited literature [15 references]  Display  Hide  Download

https://hal.inria.fr/hal-00776337
Contributor : Stefan Hetzl <>
Submitted on : Tuesday, January 15, 2013 - 1:58:05 PM
Last modification on : Thursday, January 7, 2021 - 3:40:14 PM
Long-term archiving on: : Tuesday, April 16, 2013 - 3:55:02 AM

File

ascop.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-00776337, version 1

Collections

Citation

Stefan Hetzl. Project Presentation: Algorithmic Structuring and Compression of Proofs (ASCOP). Conferences on Intelligent Computer Mathematics (CICM) 2012, Jul 2012, Bremen, Germany. ⟨hal-00776337⟩

Share

Metrics

Record views

441

Files downloads

340