9 - 12 July 2018, Twenty-first International Conference on Theory & Applications of Satisfiability Testing (SAT 2018), Oxford, England
The International Conference on Theory and Applications of Satisfiability Testing (SAT) is the premier annual meeting for researchers focusing on the theory and applications of the propositional satisfiability problem, broadly construed. In addition to plain propositional satisfiability, it also includes Boolean optimization (such as 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. SAT 2018 will take place as part of the Federated Logic Conference (FLoC) in Oxford.
SAT 2018 welcomes scientific contributions addressing different aspects of the satisfiability problem, interpreted in a broad sense. including (but not restricted to) theoretical advances (such as 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 application domains and improvements to existing approaches), as well as case studies and reports on findings based on rigorous experimentation.
Submissions to SAT 2018 are solicited in three paper categories, describing original contributions: long papers, short papers and tool papers. Long and short papers should contain original research, with sufficient detail to assess the merits and relevance of the contribution. A tool paper should describe an implemented tool and its novel features.