[Back]

M. Heule, B. Kiesl, A. Biere:
"Short Proofs Without New Variables";
Talk: CADE 26 - 26th International Conference on Automated Deduction, Gothenburg, Sweden; 2017-08-06 - 2017-08-11; in: "Automated Deduction - CADE 26 - 26th International Conference on Automated Deduction, Gothenburg, Sweden, August 6-11, 2017, Proceedings", L. de Moura (ed.); Springer, Lecture Notes in Computer Science / 10395 (2017), ISBN: 978-3-319-63046-5; 130 - 147.

Adding and removing redundant clauses is at the core of state-of-the-art SAT solving. Crucial is the ability to add short clauses whose redundancy can be determined in polynomial time. We present a characterization of the strongest notion of clause redundancy (i.e., addition of the clause preserves satisfiability) in terms of an implication relationship. By using a polynomial-time decidable implication relation based on unit propagation, we thus obtain an efficiently checkable redundancy notion. A proof system based on this notion is surprisingly strong, even without the introduction of new variables-the key component of short proofs presented in the proof complexity literature. We demonstrate this strength on the famous pigeon hole formulas by providing short clausal proofs without new variables.

propositional logic, sat solving, proofs, proof complexity

http://dx.doi.org/10.1007/978-3-319-63046-5_9

http://publik.tuwien.ac.at/files/publik_266832.pdf