 |
Free and accessible knowledge |
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.
Cited literature [16 references]
https://hal.archives-ouvertes.fr/hal-01166922
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
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
File
boudou_12885.pdf
Files produced by the author(s)