TY - GEN
T1 - Towards a better understanding of the functionality of a conflict-driven SAT solver
AU - Dershowitz, Nachum
AU - Hanna, Ziyad
AU - Nadel, Alexander
PY - 2007
Y1 - 2007
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=38049101082&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-72788-0_27
DO - 10.1007/978-3-540-72788-0_27
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:38049101082
SN - 9783540727873
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 287
EP - 293
BT - Theory and Applications of Satisfiability Testing - SAT 2007 - 10th International Conference, Proceedings
PB - Springer Verlag
T2 - 10th International Conference on Theory and Applications of Satisfiability Testing, SAT 2007
Y2 - 28 May 2007 through 31 May 2007
ER -