TY - GEN
T1 - Generalizing DPLL to richer logics
AU - McMillan, Kenneth L.
AU - Kuehlmann, Andreas
AU - Sagiv, Mooly
PY - 2009
Y1 - 2009
N2 - The DPLL approach to the Boolean satisfiability problem (SAT) is a combination of search for a satisfying assignment and logical deduction, in which each process guides the other. We show that this approach can be generalized to a richer class of theories. In particular, we present an alternative to lazy SMT solvers, in which DPLL is used only to find propositionally satisfying assignments, whose feasibility is checked by a separate theory solver. Here, DPLL is applied directly to the theory. We search in the space of theory structures (for example, numerical assignments) rather than propositional assignments. This makes it possible to use conflict in model search to guide deduction in the theory, much in the way that it guides propositional resolution in DPLL. Some experiments using linear rational arithmetic demonstrate the potential advantages of the approach.
AB - The DPLL approach to the Boolean satisfiability problem (SAT) is a combination of search for a satisfying assignment and logical deduction, in which each process guides the other. We show that this approach can be generalized to a richer class of theories. In particular, we present an alternative to lazy SMT solvers, in which DPLL is used only to find propositionally satisfying assignments, whose feasibility is checked by a separate theory solver. Here, DPLL is applied directly to the theory. We search in the space of theory structures (for example, numerical assignments) rather than propositional assignments. This makes it possible to use conflict in model search to guide deduction in the theory, much in the way that it guides propositional resolution in DPLL. Some experiments using linear rational arithmetic demonstrate the potential advantages of the approach.
UR - http://www.scopus.com/inward/record.url?scp=70350241657&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-02658-4_35
DO - 10.1007/978-3-642-02658-4_35
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:70350241657
SN - 3642026575
SN - 9783642026577
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 462
EP - 476
BT - Computer Aided Verification - 21st International Conference, CAV 2009, Proceedings
T2 - 21st International Conference on Computer Aided Verification, CAV 2009
Y2 - 26 June 2009 through 2 July 2009
ER -