Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an Efficient SAT Solver. In: Proc. of DAC (2001)
Simon, L., Le Berre, D., Hirsch, E.A.: The SAT 2002 Competition
Freeman, J.W.: Improvements to propositional satisfiability search algorithms. PhD thesis, University of Pennsylvania (1995)
Li, C.M., Anbulagan: Heuristics Based on Unit Propagation for Satisfiability Problems. In: Proc. of IJCAI, pp. 366–371. Morgan-Kauffmann, San Francisco (1997)
Bayardo Jr., R.J., Schrag, R.C.: Using CSP Look-Back Techniques to Solve Real-World SAT instances. In: Proc. of AAAI, pp. 203–208. AAAI Press, Menlo Park (1997)
Bacchus, F.: Enhancing Davis Putnam with Extended Binary Clause Reasoning. In: Proc. of AAAI. AAAI Press, Menlo Park (2001)
Gu, J., Purdom, P.W., Franco, J., Wah, B.W.: Algorithms for the Satisfiability (SAT) Problem: A Survey. In: Satisfiability Problem: Theory and Applications. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pp. 19–153. AMS, Providence (1997)
Giunchiglia, E., Maratea, M., Tacchella, A.: (In)Effectiveness of Look-Ahead Techniques in a Modern SAT Solver, Technical report (2003), available at http://www.mrg.dist.unige.it/~tac/Reports/failed.ps
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Giunchiglia, E., Maratea, M., Tacchella, A. (2003). (In)Effectiveness of Look-Ahead Techniques in a Modern SAT Solver. In: Rossi, F. (eds) Principles and Practice of Constraint Programming – CP 2003. CP 2003. Lecture Notes in Computer Science, vol 2833. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45193-8_64
Download citation
DOI: https://doi.org/10.1007/978-3-540-45193-8_64
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20202-8
Online ISBN: 978-3-540-45193-8
eBook Packages: Springer Book Archive