14. SAT 2011: Ann Arbor, MI, USA

Invited Talks

Complexity Analysis

Binary Decision Diagrams

Theoretical Analysis

Extraction of Minimal Unsatisfiable Subsets

SAT Algorithms

Quantified Boolean Formulae

Model Enumeration, Local Search

Empirical Evaluation

Extended Abstracts

maintained by Schloss Dagstuhl LZI at University of Trier