21st SAT 2018: Oxford, UK

Invited Talk

Maximum Satisfiability

Conflict Driven Clause Learning

Model Counting

Quantified Boolean Formulae

Theory

Minimally Unsatisfiable Sets

Satisfiability Modulo Theories

Tools and Applications

maintained by Schloss Dagstuhl LZI at University of Trier