Atomic Cut Introduction by Resolution: Proof Structuring and Compression

Bruno Woltzenlogel Paleo 1, *
* Corresponding author
1 VERIDIS - VERIfication pour les systèmes DIStribués
Inria Nancy - Grand Est, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications : UMR7503
Abstract : The careful introduction of cut inferences can be used to structure and possibly compress formal sequent calculus proofs. This pa- per presents CIRes, an algorithm for the introduction of atomic cuts based on various modifications and improvements of the CERes method, which was originally devised for efficient cut-elimination. It is also demonstrated that CIRes is capable of compressing proofs, and the amount of compres- sion is shown to be exponential in the length of proofs.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [19 references]  Display  Hide  Download
Contributor : Bruno Woltzenlogel Paleo <>
Submitted on : Saturday, December 11, 2010 - 12:55:31 PM
Last modification on : Thursday, February 21, 2019 - 2:02:02 PM
Document(s) archivé(s) le : Saturday, March 12, 2011 - 2:27:21 AM


Files produced by the author(s)




Bruno Woltzenlogel Paleo. Atomic Cut Introduction by Resolution: Proof Structuring and Compression. Edmund M. Clarke and Andrei Voronkov. Logic for Programming, Artificial Intelligence, and Reasoning, Apr 2010, Dakar, Senegal. Springer, Logic for Programming, Artificial Intelligence, and Reasoning: 16th International Conference, LPAR-16, Dakar, Senegal, April 25--May 1, 2010, Revised Selected Papers, 6355, pp.463-480, 2011, Lecture Notes in Computer Science / Lecture Notes in Artificial Intelligence. 〈10.1007/978-3-642-17511-4_26〉. 〈hal-00545473〉



Record views


Files downloads