System Description: The Proof Transformation System CERES

Tsvetan Dunchev 1 Alexander Leitsch 1 Tomer Libal 1 Daniel Weller 1 Bruno Woltzenlogel Paleo 2, *
* Corresponding author
2 VERIDIS - VERIfication pour les systèmes DIStribués
Inria Nancy - Grand Est, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications : UMR7503
Abstract : Cut-elimination is the most prominent form of proof trans- formation in logic. The elimination of cuts in formal proofs corresponds to the removal of intermediate statements (lemmas) in mathematical proofs. The cut-elimination method CERES (cut-elimination by resolu- tion) works by extracting a set of clauses from a proof with cuts. Any resolution refutation of this set then serves as a skeleton of an ACNF, an LK-proof with only atomic cuts. The system CERES, an implementation of the CERES-method has been used successfully in analyzing nontrivial mathematical proofs (see [4]).In this paper we describe the main features of the CERES system with spe- cial emphasis on the extraction of Herbrand sequents and simplification methods on these sequents. We demonstrate the Herbrand sequent ex- traction and simplification by a mathematical example.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [12 references]  Display  Hide  Download
Contributor : Bruno Woltzenlogel Paleo <>
Submitted on : Friday, December 10, 2010 - 12:41:07 PM
Last modification on : Thursday, February 21, 2019 - 2:02:02 PM
Document(s) archivé(s) le : Monday, November 5, 2012 - 1:10:40 PM


Files produced by the author(s)




Tsvetan Dunchev, Alexander Leitsch, Tomer Libal, Daniel Weller, Bruno Woltzenlogel Paleo. System Description: The Proof Transformation System CERES. International Joint Conference on Automated Reasoning, Jul 2010, Edinburgh, United Kingdom. pp.427-433, ⟨10.1007/978-3-642-14203-1_36⟩. ⟨hal-00545482⟩



Record views


Files downloads