@Article{biere_et_al:DagRep.5.4.98,
author = {Biere, Armin and Ganesh, Vijay and Grohe, Martin and Nordstr\"{o}m, Jakob and Williams, Ryan},
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 = {Biere, Armin and Ganesh, Vijay and Grohe, Martin and Nordstr\"{o}m, Jakob and Williams, Ryan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.5.4.98},
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 complexity, parameterized complexity}
}