Project Presentation: Algorithmic Structuring and Compression of Proofs ASCOPReportar como inadecuado

Project Presentation: Algorithmic Structuring and Compression of Proofs ASCOP - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

1 PARSIFAL - Proof search and reasoning with logic specifications LIX - Laboratoire d-informatique de l-École polytechnique Palaiseau, Inria Saclay - Ile de France, Polytechnique - X, CNRS - Centre National de la Recherche Scientifique : UMR7161

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.

Autor: Stefan Hetzl -



Documentos relacionados