Project Presentation: Algorithmic Structuring and Compression of Proofs (ASCOP)
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 efficient algorithms based on formal grammars to structure and compress proofs.
KeywordsProof Theory Analytic Proof Tree Language Automate Theorem Prover Formal Language Theory
Unable to display preview. Download preview PDF.
- 1.Generic Architecture for Proofs (GAPT), http://code.google.com/p/gapt/
- 7.Herbrand, J.: Recherches sur la théorie de la démonstration. Ph.D. thesis, Université de Paris (1930)Google Scholar
- 8.Hetzl, S.: Proofs as Tree Languages, submitted, preprint, http://hal.archives-ouvertes.fr/hal-00613713/
- 12.Hetzl, S., Straßburger, L.: Herbrand-Confluence for Cut-Elimination in Classical First-Order Logic (submitted)Google Scholar
- 15.McGuire, G., Tugemann, B., Civario, G.: There is no 16-Clue Sudoku: Solving the Sudoku Minimum Number of Clues Problem, http://arxiv.org/abs/1201.0749