Biere A. (ed.) Handbook of satisfiability

2nd edition. — New York: IOS, 2021. — 1486 p.Preface First Edition
Preface Second EditionTheory and Algorithms
A History of Satisfiability
CNF Encodings
Complete Algorithms
CDCL SAT Solving
Look-Ahead Based SAT Solvers
Incomplete Algorithms
Proof Complexity and SAT Solving
Fundaments of Branching Heuristics
Preprocessing in SAT Solving
Random Satisfiability
Exploiting Runtime Variation in Complete Solvers
Automated Configuration and Selection of SAT Solvers
Symmetry and Satisfiability
Minimal Unsatisfiability and Autarkies
Proofs of Unsatisfiability
Worst-Case Upper Bounds
Fixed-Parameter Tractability
Applications and Extensions
Bounded Model Checking
Planning and SAT
Software Verification
Combinatorial Designs by SAT Solvers
Connections to Statistical Physics
MaxSAT
Maximum Satisfiability
Model Counting
Approximate Model Counting
Non-Clausal SAT and ATPG
Pseudo-Boolean and Cardinality Constraints
QBF Theory
QBFs reasoning
Quantified Boolean Formulas
SAT Techniques for Modal and Description Logics
Satisfiability Modulo Theories
Stochastic Boolean SatisfiabilityCited Author Index
Contributing Authors and Affiliations