Abstract
We show that modern conflict-driven SAT solvers implicitly build and prune a decision tree whose nodes are associated with flipped variables. Practical usefulness of conflict-driven learning schemes, like 1UIP or AllUIP, depends on their ability to guide the solver towards refutations associated with compact decision trees. We propose an enhancement of 1UIP that is empirically helpful for real-world industrial benchmarks.
This research was supported in part by the Israel Science Foundation (grant no. 250/05). The work of Alexander Nadel was carried out in partial fulfillment of the requirements for a Ph.D.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Moskewicz, M.W., et al.: Chaff: Engineering an efficient SAT solver. In: DAC’01, Las Vegas, NV, pp. 530–535 (2001), doi:10.1145/378239.379017
Nadel, A., et al.: Eureka-2006 SAT solver, http://fmv.jku.at/sat-race-2006/descriptions/4-Eureka.pdf
Ryan, L.O.: Efficient algorithms for clause learning SAT solvers. Master’s thesis, Simon Fraser University, Burnaby, Canada (2004)
Silva, J.P.M., Sakallah, K.A.: GRASP—a new search algorithm for satisfiability. In: ICCAD’96, San Jose, California, United States, pp. 220–227. IEEE Computer Society Press, Los Alamitos (1996)
Zhang, L., et al.: Efficient conflict driven learning in a Boolean satisfiability solver. In: ICCAD’01, San Jose, CA, pp. 279–285. IEEE Computer Society Press, Los Alamitos (2001)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Dershowitz, N., Hanna, Z., Nadel, A. (2007). Towards a Better Understanding of the Functionality of a Conflict-Driven SAT Solver. In: Marques-Silva, J., Sakallah, K.A. (eds) Theory and Applications of Satisfiability Testing – SAT 2007. SAT 2007. Lecture Notes in Computer Science, vol 4501. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72788-0_27
Download citation
DOI: https://doi.org/10.1007/978-3-540-72788-0_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72787-3
Online ISBN: 978-3-540-72788-0
eBook Packages: Computer ScienceComputer Science (R0)