Handbook of Satisfiability (2021) (www.iospress.com)

The Handbook of Satisfiability (2nd, updated edition, 2021) is a comprehensive, two-part reference (1484 pages) that synthesizes decades of theoretical and practical advances in propositional satisfiability (SAT) and closely related areas. Framing SAT as both a foundational logic problem and a universal way to express combinatorial problems, the volume collects state-of-the-art chapters on solver design, search algorithms and heuristics, algorithmic analysis, hard-instance generation and randomized formulae, encoding strategies, and large-scale industrial applications. It also broadens the scope beyond propositional SAT to quantified Boolean formulae (QBF), constraint programming (CSP) encodings, and satisfiability modulo theories (SMT), with extensive bibliographies and empirical case studies. For the AI/ML community, this handbook is significant because SAT/SMT/QBF methods underlie many core tasks—verification and synthesis of models, symbolic reasoning, planning, combinatorial optimization, and parts of probabilistic inference and neural-symbolic integration. The book’s detailed treatment of solver internals (simplifiers, heuristics, benchmarking) and encoding trade-offs provides practical guidance for turning high-level problems into tractable instances, and its empirical results inform choices that affect scalability and robustness. Intended for researchers, graduate students and practitioners, the handbook serves as both a technical encyclopedia and a roadmap for applying automated satisfiability techniques across AI and systems research.