TY - GEN
T1 - Proving termination with (Boolean) satisfaction
AU - Codish, Michael
PY - 2008/12/1
Y1 - 2008/12/1
N2 - At some point there was the Davis-Putnam-Logemann-Loveland (DPLL) algorithm [6]. Forty five years later, research on Boolean satisfiability (SAT) is still ceaselessly generating even better SAT solvers capable of handling even larger SAT instances. Remarkably, the majority of these tools still bear the hallmark of the DPLL algorithm. In sync with the availability of progressively stronger SAT solvers is an accumulating number of applications which demonstrate that real world problems can often be solved by encoding them into SAT. When successful, this circumvents the need to redevelop complex search algorithms from scratch.
AB - At some point there was the Davis-Putnam-Logemann-Loveland (DPLL) algorithm [6]. Forty five years later, research on Boolean satisfiability (SAT) is still ceaselessly generating even better SAT solvers capable of handling even larger SAT instances. Remarkably, the majority of these tools still bear the hallmark of the DPLL algorithm. In sync with the availability of progressively stronger SAT solvers is an accumulating number of applications which demonstrate that real world problems can often be solved by encoding them into SAT. When successful, this circumvents the need to redevelop complex search algorithms from scratch.
UR - http://www.scopus.com/inward/record.url?scp=58449130805&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-78769-3_1
DO - 10.1007/978-3-540-78769-3_1
M3 - Conference contribution
AN - SCOPUS:58449130805
SN - 3540787682
SN - 9783540787686
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 1
EP - 7
BT - Logic-Based Program Synthesis and Transformation - 17th International Symposium, LOPSTR 2007, Revised Selected Papers
T2 - 17th International Symposium on Logic-Based Program Synthesis and Transformation, LOPSTR 2007
Y2 - 23 August 2007 through 24 August 2007
ER -