论文信息 - Reconstructing Solutions after Blocked Clause Elimination

Reconstructing Solutions after Blocked Clause Elimination

Preprocessing has proven important in enabling efficient Boolean satisfiability (SAT) solving. For many real application scenarios of SAT it is important to be able to extract a full satisfying assignment for original SAT instances from a satisfying assignment for the instances after preprocessing. We show how such full solutions can be efficiently reconstructed from solutions to the conjunctive normal form (CNF) formulas resulting from applying a combination of various CNF preprocessing techniques implemented in the PrecoSAT solver—especially, blocked clause elimination combined with SatElite-style variable elimination and equivalence reasoning.

Armin Biere | Matti Järvisalo

[1] Ofer Strichman,et al. Cost-Effective Hyper-Resolution for Preprocessing CNF Formulas , 2005, SAT.

[2] Fahiem Bacchus,et al. Enhancing Davis Putnam with extended binary clause reasoning , 2002, AAAI/IAAI.

[3] Armin Biere,et al. Effective Preprocessing in SAT Through Variable and Clause Elimination , 2005, SAT.

[4] Oliver Kullmann,et al. On a Generalization of Extended Resolution , 1999, Discret. Appl. Math..

[5] Hilary Putnam,et al. A Computing Procedure for Quantification Theory , 1960, JACM.

[6] Armin Biere,et al. Blocked Clause Elimination , 2010, TACAS.

[7] Fahiem Bacchus,et al. Effective Preprocessing with Hyper-Resolution and Equality Reduction , 2003, SAT.