Skip to Main content Skip to Navigation
Conference papers

Compression of Propositional Resolution Proofs by Lowering Subproofs

Abstract : This paper describes a generalization of the LowerUnits algorithm for the compression of propositional resolution proofs. The generalized algorithm, here called LowerUnivalents, is able to lower not only units but also subproofs of non-unit clauses, provided that they satisfy some additional conditions. This new algorithm is particularly suited to be combined with the RecyclePivotsWithIntersection algorithm. A formal proof that LowerUnivalents always compresses more than LowerUnits is shown, and both algorithms are empirically compared on thousands of proofs produced by the SMT-Solver veriT.
Complete list of metadata

Cited literature [16 references]  Display  Hide  Download
Contributor : Open Archive Toulouse Archive Ouverte (OATAO) Connect in order to contact the contributor
Submitted on : Tuesday, June 23, 2015 - 2:38:48 PM
Last modification on : Monday, July 4, 2022 - 9:17:27 AM
Long-term archiving on: : Tuesday, April 25, 2017 - 6:25:15 PM


Files produced by the author(s)


  • HAL Id : hal-01166922, version 1
  • OATAO : 12885


Joseph Boudou, Bruno Woltzenlogel Paleo. Compression of Propositional Resolution Proofs by Lowering Subproofs. 22nd International Conference TABLEAUX : Automated Reasoning with Analytic Tableaux and Related Methods - TABLEAUX 2013, Sep 2013, Nancy, France. pp. 59-73. ⟨hal-01166922⟩



Record views


Files downloads