Overview
The International Conference on Theory and Applications of Satisfiability Testing is the primary annual meeting for researchers studying the propositional satisfiability problem (SAT). See www.satisfiability.org for information on previous meetings. The conference will have two days of affiliated workshops and will also hosts a number of competitions and evaluations (SAT, MaxSAT, PB).All papers must follow the LNCS style authors instructions . The submission page will be done via easychair SAT'2011
Affiliated Events
SAT
Competition
PB
Evaluation
MAX-SAT
Evaluation
Scope
The topics of the conference span practical and theoretical research on SAT and its applications and include but are not limited to:
- Proof Systems and Proof Complexity
- Search Algorithms and Heuristics
- Analysis of Algorithms
- Hard Instances
- Randomized Formulae
- Problem Encodings
- Industrial Applications
- Solvers, Simplifiers and Tools
- Case Studies and Empirical Results
SAT is interpreted in a broad sense: besides propositional satisfiability, it includes the domains of pseudo-Boolean constraint solving and optimization (PB), quantified boolean formulae (QBF), constraint programming techniques (CSP) for word-level problems and their propositional encoding, and satisfiability modulo theories (SMT).
SAT/SMT Solver Summer School 2011
The SAT 2011 conference is held just a few days after the SAT/SMT Solver Summer School 2011 (from June 12th to June 17th), located at MIT, Cambridge, USA.
