License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagRep.5.4.98
URN: urn:nbn:de:0030-drops-53520
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2015/5352/
Biere, Armin ;
Ganesh, Vijay ;
Grohe, Martin ;
Nordström, Jakob ;
Williams, Ryan
Weitere Beteiligte (Hrsg. etc.): Armin Biere and Vijay Ganesh and Martin Grohe and Jakob Nordström and Ryan Williams
Theory and Practice of SAT Solving (Dagstuhl Seminar 15171)
Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 15171 "Theory and Practice of SAT Solving". The purpose of this workshop was to explore one of the most significant problems in all of computer science, namely that of computing whether formulas in propositional logic are satisfiable or not. This problem is believed to be intractable in general (by the theory of NP-completeness). However, the last two decades have seen dramatic developments in algorithmic techniques, and today so-called SAT solvers are routinely and successfully used to solve large-scale real-world instances in a wide range of application areas.
A surprising aspect of this development is that the best current SAT solvers are still to a large extent based on methods from the early 1960s, which can often handle formulas with millions of variables but may also get hopelessly stuck on formulas with just a few hundred variables. The fundamental question of when SAT solvers perform well or badly, and what underlying mathematical properties of the formulas influence SAT solver performance, remains very poorly understood.
Another intriguing aspect is that much stronger mathematical methods of reasoning about propositional logic formulas are known today, in particular methods based on algebra and geometry, and these methods would seem to have great potential based on theoretical studies. However, attempts at harnessing the power of such methods have conspicuously failed to deliver any significant
improvements in practical performance. This workshop gathered leading researchers in applied and theoretical areas of SAT and computational complexity to stimulate an increased exchange of ideas between these two communities. We see great opportunities for fruitful interplay between theoretical and applied research in this area, and believe that this workshop showed beyond doubt that a more vigorous interaction between the two has potential for major long-term impact in computer science, as well for applications in industry.
BibTeX - Entry
@Article{biere_et_al:DR:2015:5352,
author = {Armin Biere and Vijay Ganesh and Martin Grohe and Jakob Nordstr{\"o}m and Ryan Williams},
title = {{Theory and Practice of SAT Solving (Dagstuhl Seminar 15171)}},
pages = {98--122},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2015},
volume = {5},
number = {4},
editor = {Armin Biere and Vijay Ganesh and Martin Grohe and Jakob Nordstr{\"o}m and Ryan Williams},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2015/5352},
URN = {urn:nbn:de:0030-drops-53520},
doi = {10.4230/DagRep.5.4.98},
annote = {Keywords: SAT, Boolean SAT solvers, SAT solving, conflict-driven clause learning, Gr{\"o}bner bases, pseudo-Boolean solvers, proof complexity, computational }
}
|
Keywords: |
|
SAT, Boolean SAT solvers, SAT solving, conflict-driven clause learning, Gröbner bases, pseudo-Boolean solvers, proof complexity, computational |
|
Freie Schlagwörter (englisch): |
|
complexity, parameterized complexity |
|
Collection: |
|
Dagstuhl Reports, Volume 5, Issue 4 |
|
Issue Date: |
|
2015 |
|
Date of publication: |
|
16.12.2015 |
