The Inter national Conference on Theory and Applications of Satisfiability Testing (SAT) is the premier annual meeting for researchers focusing on the theory an d applications of the propositional satisfiability problem, broadly construed. In addition to plain propositional satisfiability, it also includes Boo lean optimization (such as MaxSAT and Pseudo-Boole an (PB) constraints), Quantified Boolean Formulas (QBF), Satisfiability Modulo Theories (SMT), and C onstraint Programming (CP) for problems with clear connections to Boolean-level reasoning. SAT 2018 will take place as part of the Federated Logic Con ference (FLoC) in Oxford.
\nS AT 2018 welcomes scientific contributions addressi ng different aspects of the satisfiability problem , interpreted in a broad sense. including (bu t not restricted to) theoretical advances (such as exact algorithms, proof complexity, and other com plexity issues), practical search algorithms, know ledge compilation, implementation-level details of SAT solvers and SAT-based systems, problem encodi ngs and reformulations, applications (including bo th novel application domains and improvements to e xisting approaches), as well as case studies and r eports on findings based on rigorous experimentati on.
\n\nSubmissions to SAT 2018 are solici ted in three paper categories, describing original contributions: long papers, short papers and tool papers. Long and short papers should contain orig inal research, with sufficient detail to assess th e merits and relevance of the contribution. A tool paper should describe an implemented tool and its novel features.
\n