MARC

LEADER 00000cam a2200000 a 4500
001 EBSCO_on1252418310
003 OCoLC
005 20231017213018.0
006 m o d
007 cr cnu---unuuu
008 210522s2021 ne o 000 0 eng d
040 |a EBLCP  |b eng  |e pn  |c EBLCP  |d N$T  |d OCLCO  |d YDX  |d IOSPR  |d OCLCO  |d OCLCF  |d OCLCQ  |d OCLCO  |d OCLCQ  |d OCLCO 
019 |a 1255221966  |a 1255222204 
020 |a 9781643681610  |q (electronic bk.) 
020 |a 1643681613  |q (electronic bk.) 
035 |a (OCoLC)1252418310  |z (OCoLC)1255221966  |z (OCoLC)1255222204 
037 |a 9781643681610  |b IOS Press  |n http://www.iospress.nl 
050 4 |a QA9.3  |b .H36 2021eb 
082 0 4 |a 511.3  |2 23 
049 |a UAMI 
245 0 0 |a Handbook of satisfiability /  |c editors: Armin Biere, Marijn Heule, Hans van Maaren, Toby Walsh. 
250 |a Second edition. 
260 |a Amsterdam :  |b IOS Press,  |c 2021. 
300 |a 1 online resource (1486 pages) 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
490 1 |a Frontiers in Artificial Intelligence and Applications ;  |v v. 336 
588 0 |a Print version record. 
505 0 |a 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 
505 8 |a 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 
505 8 |a 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 
590 |a eBooks on EBSCOhost  |b EBSCO eBook Subscription Academic Collection - Worldwide 
650 0 |a Propositional calculus  |v Congresses. 
650 0 |a Decision making  |v Congresses. 
650 0 |a Computer algorithms  |v Congresses. 
650 0 |a Algebra, Boolean  |v Congresses. 
650 6 |a Calcul propositionnel  |v Congrès. 
650 6 |a Prise de décision  |v Congrès. 
650 6 |a Algorithmes  |v Congrès. 
650 6 |a Algèbre de Boole  |v Congrès. 
650 7 |a Algebra, Boolean  |2 fast 
650 7 |a Computer algorithms  |2 fast 
650 7 |a Decision making  |2 fast 
650 7 |a Propositional calculus  |2 fast 
655 7 |a Conference papers and proceedings  |2 fast 
700 1 |a Biere, Armin. 
700 1 |a Heule, Marijn,  |d 1979- 
700 1 |a Maaren, Hans van. 
776 0 8 |i Print version:  |a Biere, A.  |t Handbook of Satisfiability.  |d : IOS Press, Incorporated, ©2021  |z 9781643681610 
830 0 |a Frontiers in artificial intelligence and applications ;  |v v. 336. 
856 4 0 |u https://ebsco.uam.elogim.com/login.aspx?direct=true&scope=site&db=nlebk&AN=2934688  |z Texto completo 
938 |a ProQuest Ebook Central  |b EBLB  |n EBL28617772 
938 |a EBSCOhost  |b EBSC  |n 2934688 
938 |a YBP Library Services  |b YANK  |n 302217008 
994 |a 92  |b IZTAP