Handbook of Satisfiability: Second Edition

The Handbook of Satisfiability is a comprehensive guide to propositional satisfiability (SAT) problems, covering practical and theoretical research, search algorithms, heuristics, analysis of algorithms, hard instances, randomized formulae, problem encodings, industrial applications, solvers, simplifiers, tools, case studies, and empirical results. It spans propositional satisfiability, quantified Boolean formulae (QBF), constraints programming techniques (CSP), and satisfiability modulo theories (SMT).

Format: Hardback
Publication date: 29 April 2025
Publisher: SAGE Publications

Propositional logic has been recognized as a fundamental cornerstone of reasoning in philosophy and mathematics for centuries. Its formalization into Boolean algebra led to the recognition that a wide range of combinatorial problems can be expressed as propositional satisfiability (SAT) problems. As a result, SAT developed into a mature, multi-faceted scientific discipline, and from the earliest days of computing, a search was underway to discover how to solve SAT problems in an automated fashion. This book, the Handbook of Satisfiability, is the second, updated and revised edition of the book first published in 2009 under the same name. The handbook aims to capture the full breadth and depth of SAT and to bring together significant progress and advances in automated solving. Topics covered span practical and theoretical research on SAT and its applications and include search algorithms, heuristics, analysis of algorithms, hard instances, randomized formulae, problem encodings, industrial applications, solvers, simplifiers, tools, case studies and empirical results. SAT is interpreted in a broad sense, so as well as propositional satisfiability, there are chapters covering the domain of quantified Boolean formulae (QBF), constraints programming techniques (CSP) for word-level problems and their propositional encoding, and satisfiability modulo theories (SMT). An extensive bibliography completes each chapter. This second edition of the handbook will be of interest to researchers, graduate students, final-year undergraduates, and practitioners using or contributing to SAT, and will provide both an inspiration and a rich resource for their work. Edmund Clarke, 2007 ACM Turing Award Recipient: SAT solving is a key technology for 21st century computing.

Weight: 2956g
Dimension: 176 x 252 x 95 (mm)
ISBN-13: 9781643681603