
Handbook of Satisfiability
Description
Alles über E-Books | Antworten auf Fragen rund um E-Books, Kopierschutz und Dateiformate finden Sie in unserem Info- & Hilfebereich.
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 computer science.""
Donald Knuth, 1974 ACM Turing Award Recipient:
""SAT is evidently a killer app, because it is key to the solution of so many other problems.""
Stephen Cook, 1982 ACM Turing Award Recipient:
""The SAT problem is at the core of arguably the most fundamental question in computer science: What makes a problem hard?""
More details
Other editions
Additional editions

Content
- Intro
- Title Page
- Preface First Edition
- Preface Second Edition
- Contents
- Part I. Theory and Algorithms
- Chapter 1. A History of Satisfiability
- Chapter 2. CNF Encodings
- Chapter 3. Complete Algorithms
- Chapter 4. CDCL SAT Solving
- Chapter 5. Look-Ahead Based SAT Solvers
- Chapter 6. Incomplete Algorithms
- Chapter 7. Proof Complexity and SAT Solving
- Chapter 8. Fundaments of Branching Heuristics
- Chapter 9. Preprocessing in SAT Solving
- Chapter 10. Random Satisfiability
- Chapter 11. Exploiting Runtime Variation in Complete Solvers
- Chapter 12. Automated Configuration and Selection of SAT Solvers
- Chapter 13. Symmetry and Satisfiability
- Chapter 14. Minimal Unsatisfiability and Autarkies
- Chapter 15. Proofs of Unsatisfiability
- Chapter 16. Worst-Case Upper Bounds
- Chapter 17. Fixed-Parameter Tractability
- Part II. Applications and Extensions
- Chapter 18. Bounded Model Checking
- Chapter 19. Planning and SAT
- Chapter 20. Software Verification
- Chapter 21. Combinatorial Designs by SAT Solvers
- Chapter 22. Connections to Statistical Physics
- Chapter 23. MaxSAT
- Chapter 24. Maximum Satisfiability
- Chapter 25. Model Counting
- Chapter 26. Approximate Model Counting
- Chapter 27. Non-Clausal SAT and ATPG
- Chapter 28. Pseudo-Boolean and Cardinality Constraints
- Chapter 29. QBF Theory
- Chapter 30. QBFs reasoning
- Chapter 31. Quantified Boolean Formulas
- Chapter 32. SAT Techniques for Modal and Description Logics
- Chapter 33. Satisfiability Modulo Theories
- Chapter 34. Stochastic Boolean Satisfiability
- Subject Index
- Cited Author Index
- Contributing Authors and Affiliations
System requirements
File format: PDF
Copy protection: Watermark-DRM (Digital Rights Management)
System requirements:
- Computer (Windows; MacOS X; Linux): Use the free software Adobe Reader, Adobe Digital Editions, or any other PDF viewer of your choice (see eBook Help).
- Tablet/Smartphone (Android; iOS): Install the free app Adobe Digital Editions or another reading app for eBooks, e.g., PocketBook (see eBook Help).
- E-reader: Bookeen, Kobo, Pocketbook, Sony, Tolino and many more (only limited: Kindle).
The file format PDF always displays a book page identically on any hardware. This makes PDF suitable for complex layouts such as those used in textbooks and reference books (images, tables, columns, footnotes). Unfortunately, on the small screens of e-readers or smartphones, PDFs are rather annoying, requiring too much scrolling.
This eBook uses Watermark-DRM, a „soft” copy protection. This means that there are no technical restrictions to prevent illegal distribution. However, there is a personalised watermark embedded in the eBook that can be used to identify the purchaser of the eBook in the event of misuse and to provide evidence for legal purposes.
For more information, see our eBook Help page.