Title Handbook of satisfiability / edited by Armin Biere [and others]

Published Amsterdam ; Washington, DC : IOS Press, ©2009

Click on the following:
EBSCO eBooks

Copies

Description 1 online resource (xiii, 966 pages) : illustrations Series Frontiers in artificial intelligence and applications, 0922-6389 ; v. 185 Frontiers in artificial intelligence and applications ; v. 185. 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 Summary A collection of papers on various theoretical and practical aspects of SAT solving. It is suitable for students and researchers Bibliography Includes bibliographical references and indexes Notes Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002. http://purl.oclc.org/DLF/benchrepro0212 MiAaHDL English Print version record digitized 2011 HathiTrust Digital Library committed to preserve pda MiAaHDL Subject Propositional calculus -- Congresses Decision making -- Congresses Computer algorithms -- Congresses Algebra, Boolean -- Congresses MATHEMATICS -- Infinity. MATHEMATICS -- Logic. Algebra, Boolean Computer algorithms Decision making Propositional calculus Algorithmus Anwendung Berechnungskomplexität Erfüllbarkeitsproblem Genre/Form Conference papers and proceedings Form Electronic book Author Biere, Armin. ISBN 9781441616784 1441616780 9781607503767 160750376X 6000014392 9786000014391

  Permalink