Compression of propositional resolution proofs via partial regularization

Authors:
Pascal Fontaine;Stephan Merz;Bruno Woltzenlogel Paleo
Affiliations:
University of Nancy and INRIA, Nancy, France;University of Nancy and INRIA, Nancy, France;University of Nancy and INRIA, Nancy, France
Venue:
CADE'11 Proceedings of the 23rd international conference on Automated deduction
Year:
2011

Citing 5
Cited 1

Proof-carrying code

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Linear-Time Reductions of Resolution Proofs

HVC '08 Proceedings of the 4th International Haifa Verification Conference on Hardware and Software: Verification and Testing
Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications

Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications
veriT: An Open, Trustable and Efficient SMT-Solver

CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Two techniques for minimizing resolution proofs

SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing

Reconstruction of z3's bit-vector proofs in HOL4 and Isabelle/HOL

CPP'11 Proceedings of the First international conference on Certified Programs and Proofs

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes two algorithms for the compression of propositional resolution proofs. The first algorithm, RecyclePivots-WithIntersection, performs partial regularization, removing an inference η when it is redundant in the sense that its pivot literal already occurs as the pivot of another inference located below in the path from η to the root of the proof. The second algorithm, LowerUnits, delays the resolution of (both input and derived) unit clauses, thus removing (some) inferences having the same pivot but possibly occurring also in different branches of the proof.