20th SAT 2017: Melbourne, VIC, Australia

Algorithms, Complexity, and Lower Bounds

Clause Learning and Symmetry Handling

Maximum Satisfiability and Minimal Correction Sets

Parallel SAT Solving

Quantified Boolean Formulas

Satisfiability Modulo Theories

SAT Encodings

Tool Papers

a service of Schloss Dagstuhl - Leibniz Center for Informatics