SAT 2013 is over. The total number of attendees was 130. Thanks to all attendees and contributors for a successful conference! SAT 2014 will take place July 14-17 in Vienna, Austria, as part of Vienna Summer of Logic 2014.
- Slides of SAT 2013 scientific presentations are available via the SAT 2013 conference program.
- SAT 2013 LNCS proceedings appear as Volume 7962 of Springer Lecture Notes in Computer Science [see also DBLP]
- SAT 2013 Location Map.
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 welcomed 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.