Talks and Poster Presentations (with Proceedings-Entry):
T. Philipp, A. Rebola Pardo:
"DRAT Proofs for XOR Reasoning";
Talk: European Conference on Logics in Artificial Intelligence (JELIA),
Cyprus;
2016-11-09
- 2016-11-11; in: "Logics in Artificial Intelligence",
Springer,
Lecture Notes in Computer Science/10021
(2016),
415
- 429.
English abstract:
Unsatisfiability proofs in the DRAT format became the de facto standard to increase the reliability of contemporary SAT solvers. We consider the problem of generating proofs for the XOR reasoning component in SAT solvers and propose two methods: direct translation transforms every XOR constraint addition inference into a DRAT proof, whereas T-translation avoids the exponential blow-up in direct translations by using fresh variables. T-translation produces DRAT proofs from Gaussian elimination records that are polynomial in the size of the input CNF formula. Experiments show that a combination of both approaches with a simple prediction method outperforms the BDD-based method.
Keywords:
proof systems, satisfiability solvers
"Official" electronic version of the publication (accessed through its Digital Object Identifier - DOI)
http://dx.doi.org/10.1007/978-3-319-48758-8_27
Related Projects:
Project Head Georg Weissenbacher:
Bit-level Accurate Reasoning and Interpolation
Created from the Publication Database of the Vienna University of Technology.