Preface

摘要

This volume contains the papers presented at the 18th International Conference on Theory and Applications of Satisfiability Testing (SAT 2015), held during September 24-27, 2015 in Austin, Texas, USA. SAT 2015 was colocated with Formal Methods in Computer-Aided Design (FMCAD 2015) and was hosted by the University of Texas at Austin. 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 prepositional 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 propositional reasoning. Many hard combinatorial problems can be tackled using SAT-based techniques, including problems that arise in formal verification, artificial intelligence, operations research, biology, cryptology, data mining, machine learning, mathematics, etc. Indeed, the theoretical and practical advances in SAT research over the past 20 years have contributed to making SAT technology an indispensable tool in various domains.