- Preliminary conference program available.
- Registration to SAT 2013 open, early registration deadline May 27.
- Accommodation and
local information available.
- Final list of accepted papers available.
- Call for presentation-only posters, deadline May 17 (passed).
The Proof-Search Problem between Bounded-Width Resolution and Bounded-Degree Semi-Algebraic Proofs
Edmund M. Clarke:
Turing's Computable Real Numbers and Why They Are Still Important Today
There Are No CNF problems
Competitions and system evaluations:
SAT Competition 2013, Configurable SAT Solver Challenge 2013, SMT-EVAL 2012, MaxSAT Evaluation 2013, QBF Gallery 2013.
- SAT-SMT Summer School 2013 in the Helsinki region during July 3-5.
- Attending SAT 2013 and CAV 2013 in a single trip
CAV 2013 takes place in St. Petersburg (Russia) immediately after SAT 2013 ends in Helsinki. Those interested in attending both SAT and CAV will find this convenient as St. Petersburg is easy to reach from Helsinki eg via a high-speed train connection. For practical details, visit the CAV 2013 website.
About SAT 2013
The International Conference on Theory and Applications of Satisfiability Testing (SAT) is the primary annual meeting for researchers focusing on the theory and applications of the propositional satisfiability problem, broadly construed: besides plain propositional satisfiability, it includes Boolean optimization (including MaxSAT and Pseudo-Boolean (PB) constraints), Quantified Boolean Formulas (QBF), Satisfiability Modulo Theories (SMT), and Constraint Programming (CP) for problems with clear connections to Boolean-level reasoning.
Many hard combinatorial problems can be attacked using SAT-based techniques, including problems that arise in formal verification, artificial intelligence, operations research, biology, cryptology, data mining, machine learning, mathematics, et cetera. Indeed, the theoretical and practical advances in SAT research over the past twenty years have contributed to making SAT technology an indispensable tool in various domains.
SAT 2013 welcomes scientific contributions addressing different aspects of SAT interpreted in a broad sense, including (but not restricted to) theoretical advances (including exact algorithms, proof complexity, and other complexity issues), practical search algorithms, knowledge compilation, implementation-level details of SAT solvers and SAT-based systems, problem encodings and reformulations, applications (including both novel applications domains and improvements to existing approaches), as well as case studies and reports on insightful findings based on rigorous experimentation.
The proceedings of SAT 2013 will be published in Springer's Lecture Notes in Computer Science series.
SAT 2013 takes place in Helsinki, the capital of Finland, a vibrant scandinavian and international city with a lot to offer to visitors. SAT 2013 is organized at University of Helsinki in the very heart of the city. SAT 2013 takes place during the main summer season, allowing one to experience the whitenights during which the sun almost never sets.