03429nam 2200685Ia 450 991045534440332120200520144314.01-4416-1678-01-60750-376-X600-00-1439-2(CKB)1000000000765302(EBL)448770(OCoLC)491253312(SSID)ssj0000338455(PQKBManifestationID)11254932(PQKBTitleCode)TC0000338455(PQKBWorkID)10295806(PQKB)10382127(MiAaPQ)EBC448770(Au-PeEL)EBL448770(CaPaEBR)ebr10309230(CaONFJC)MIL577647(OCoLC)935268045(EXLCZ)99100000000076530220081220d2009 uy 0engur|n|---|||||txtccrHandbook of satisfiability[electronic resource] /edited by Armin Biere ... [et al.]Amsterdam, The Netherlands ;Washington, DC IOS Pressc20091 online resource (980 p.)Frontiers in artificial intelligence and applications,0922-6389 ;v. 185Description based upon print version of record.1-58603-929-6 Includes bibliographical references and indexes.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 TractabilityPart II. Applications and ExtensionsChapter 14. Bounded Model Checking; Chapter 15. Planning and SAT; Chapter 16. Software Verification; Chapter 17. Combinatorial Designs by SAT Solvers; Chapter 18. Connections to Statistical Physics; Chapter 19. MaxSAT; Chapter 20. Model Counting; Chapter 21. Non-Clausal SAT and ATPG; Chapter 22. Pseudo-Boolean and Cardinality Constraints; Chapter 23. QBF Theory; Chapter 24. QBFs reasoning; Chapter 25. SAT Techniques for Modal and Description Logics; Chapter 26. Satisfiability Modulo Theories; Chapter 27. Stochastic Boolean Satisfiability; Subject IndexCited Author IndexContributing Authors and AffiliationsA collection of papers on various theoretical and practical aspects of SAT solving. It is suitable for students and researchers.Frontiers in artificial intelligence and applications ;v. 185.Propositional calculusCongressesDecision makingCongressesComputer algorithmsCongressesAlgebra, BooleanCongressesElectronic books.Propositional calculusDecision makingComputer algorithmsAlgebra, Boolean006.3Biere Armin985334MiAaPQMiAaPQMiAaPQBOOK9910455344403321Handbook of satisfiability2252075UNINA