|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNINA9910455344403321 |
|
|
Titolo |
Handbook of satisfiability [[electronic resource] /] / edited by Armin Biere ... [et al.] |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Amsterdam, The Netherlands ; ; Washington, DC, : IOS Press, c2009 |
|
|
|
|
|
|
|
ISBN |
|
1-4416-1678-0 |
1-60750-376-X |
600-00-1439-2 |
|
|
|
|
|
|
|
|
Descrizione fisica |
|
1 online resource (980 p.) |
|
|
|
|
|
|
Collana |
|
Frontiers in artificial intelligence and applications, , 0922-6389 ; ; v. 185 |
|
|
|
|
|
|
|
|
Altri autori (Persone) |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Propositional calculus |
Decision making |
Computer algorithms |
Algebra, Boolean |
Electronic books. |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Description based upon print version of record. |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references and indexes. |
|
|
|
|
|
|
Nota di contenuto |
|
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 |
Part 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 |
|
|
|
|