Proving termination with (Boolean) satisfaction

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations

Abstract

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.

Original languageEnglish
Title of host publicationLogic-Based Program Synthesis and Transformation - 17th International Symposium, LOPSTR 2007, Revised Selected Papers
Pages1-7
Number of pages7
DOIs
StatePublished - 1 Dec 2008
Event17th International Symposium on Logic-Based Program Synthesis and Transformation, LOPSTR 2007 - Kongens Lyngby, Denmark
Duration: 23 Aug 200724 Aug 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4915 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference17th International Symposium on Logic-Based Program Synthesis and Transformation, LOPSTR 2007
Country/TerritoryDenmark
CityKongens Lyngby
Period23/08/0724/08/07

Fingerprint

Dive into the research topics of 'Proving termination with (Boolean) satisfaction'. Together they form a unique fingerprint.

Cite this