论文信息 - (In)Effectiveness of Look-Ahead Techniques in a Modern SAT Solver

(In)Effectiveness of Look-Ahead Techniques in a Modern SAT Solver

In this paper we investigate the effect of adding a failed literal detection method to the traditional unit clause propagation method in the look-ahead component of a modern SAT solver. Our investigation points out that, in all the SAT instances that we have tried, failed literal detection is bound to be ineffective, even assuming it has no overhead.

Armando Tacchella | Enrico Giunchiglia | Marco Maratea

[1] Roberto J. Bayardo,et al. Using CSP Look-Back Techniques to Solve Real-World SAT Instances , 1997, AAAI/IAAI.

[2] Panos M. Pardalos,et al. Satisfiability Problem: Theory and Applications , 1997 .

[3] Jun Gu,et al. Algorithms for the satisfiability (SAT) problem: A survey , 1996, Satisfiability Problem: Theory and Applications.

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

[5] Chu Min Li,et al. Heuristics Based on Unit Propagation for Satisfiability Problems , 1997, IJCAI.

[6] Sharad Malik,et al. Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[7] J. Freeman. Improvements to propositional satisfiability search algorithms , 1995 .