Towards a Better Understanding of the Functionality of a Conflict-Driven SAT Solver
- Cite this paper as:
- 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
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.
Unable to display preview. Download preview PDF.