Handbook of satisfiability /

Mostrar otras versiones (1)
Detalles Bibliográficos
Clasificación:Libro Electrónico
Otros Autores: Biere, Armin, Heule, Marijn, 1979-, Maaren, Hans van
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Amsterdam : IOS Press, 2021.
Edición:Second edition.
Colección:Frontiers in artificial intelligence and applications ; v. 336.
Temas:
Propositional calculus > Congresses.
Decision making > Congresses.
Computer algorithms > Congresses.
Algebra, Boolean > Congresses.
Calcul propositionnel > Congrès.
Prise de décision > Congrès.
Algorithmes > Congrès.
Algèbre de Boole > Congrès.
Algebra, Boolean
Computer algorithms
Decision making
Propositional calculus
Conference papers and proceedings
Acceso en línea:Texto completo
Tabla de Contenidos:
  • 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
  • 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
  • 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

Ejemplares similares