Handbook of satisfiability. In 2 parts. 2nd updated and revised edition.

*(English)*Zbl 1456.68001
Frontiers in Artificial Intelligence and Applications 336. Amsterdam: IOS Press (ISBN 978-1-64368-160-3/pbk; 978-1-64368-161-0/ebook). xvii, 1465 p. (2021).

Publisher’s description: Propositional logic has been recognized throughout the centuries as one of the cornerstones of reasoning in philosophy and mathematics. Over time, its formalization into Boolean algebra was accompanied by the recognition that a wide range of combinatorial problems can be expressed as propositional satisfiability (SAT) problems. Because of this dual role, 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.

The articles of this volume will be reviewed individually.

For the first edition see [Zbl 1183.68568].

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.

The articles of this volume will be reviewed individually.

For the first edition see [Zbl 1183.68568].

##### MSC:

68-00 | General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to computer science |

68Q60 | Specification and verification (program logics, model checking, etc.) |

68R07 | Computational aspects of satisfiability |

68T20 | Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) |

68T27 | Logic in artificial intelligence |

00B15 | Collections of articles of miscellaneous specific interest |