SAT 2013, 16th International Conference on Theory and Applications of Satisfiability Testing, takes place July 8-12, 2013 in Helsinki, Finland.
SAT 2013 Program Committee Chairs are Matti Järvisalo (HIIT and University of Helsinki) and Allen Van Gelder (UCSC, USA).
For more details, visit http://sat2013.cs.helsinki.fi/
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.
Last updated on 3 Oct 2012 by Matti Järvisalo - Page created on 12 Jul 2013 by Matti Järvisalo