RAT Elimination
Keyword(s):
Inprocessing techniques have become one of the most promising advancements in SAT solving over the last decade. Some inprocessing techniques modify a propositional formula in non model-perserving ways. These operations are very problematic when Craig inter- polants must be extracted: existing methods take resolution proofs as an input, but these inferences require stronger proof systems; state-of-the-art solvers generate DRAT proofs. We present the first method to transform DRAT proofs into resolution-like proofs by elim- inating satisfiability-preserving RAT inferences. This solves the problem of extracting interpolants from DRAT proofs.
2018 ◽
Keyword(s):
Keyword(s):
2018 ◽
Keyword(s):
2009 ◽
Vol 34
◽
pp. 391-442
◽
2020 ◽
Vol 34
(02)
◽
pp. 1428-1435
Keyword(s):