Handbook of satisfiability

• Other Authors: Biere, Armin.
• Format: Electronic
• Language: English
• Published: Amsterdam ; Washington, DC : IOS Press, c2009.
• Series: Frontiers in artificial intelligence and applications ; v. 185.
• Subjects: Propositional calculus > Congresses.; Decision making > Congresses.; Computer algorithms > Congresses.; Algebra, Boolean > Congresses.; MATHEMATICS > Infinity.; MATHEMATICS > Logic.; Algorithmus.; Anwendung.; Berechnungskomplexität.; Erfüllbarkeitsproblem.; Electronic books.
• Online Access: ebrary; View fulltext via EzAccess; An electronic book accessible through the World Wide Web; click for information; https://ezaccess.library.uitm.edu.my/login?url=http://site.ebrary.com/lib/alltitles/Doc?id=10309230; https://ezaccess.library.uitm.edu.my/login?url=http://swb.eblib.com/patron/FullRecord.aspx?p=448770

A collection of papers on various theoretical and practical aspects of SAT solving. It is suitable for students and researchers.

Table of Contents:

• Title page; Contents; Part I. Theory and Algorithms; Chapter 1. A History of Satisfiability; Chapter 2. CNF Encodings; Chapter 3. Complete Algorithms; Chapter 4. CDCL Solvers; Chapter 5. Look-Ahead Based SAT Solvers; Chapter 6. Incomplete Algorithms; Chapter 7. Fundaments of Branching Heuristics; Chapter 8. Random Satisfiability; Chapter 9. Exploiting Runtime Variation in Complete Solvers; Chapter 10. Symmetry and Satisfiability; Chapter 11. Minimal Unsatisfiability and Autarkies; Chapter 12. Worst-Case Upper Bounds; Chapter 13. Fixed-Parameter Tractability.