Handbook of satisfiability /

Mostrar otras versiones (1)

A collection of papers on various theoretical and practical aspects of SAT solving. It is suitable for students and researchers.

Detalles Bibliográficos
Clasificación:Libro Electrónico
Otros Autores: Biere, Armin
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Amsterdam ; Washington, DC : IOS Press, ©2009.
Colección:Frontiers in artificial intelligence and applications ; v. 185.
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.
MATHEMATICS > Infinity.
MATHEMATICS > Logic.
Algebra, Boolean
Computer algorithms
Decision making
Propositional calculus
Algorithmus
Anwendung
Berechnungskomplexität
Erfüllbarkeitsproblem
Conference papers and proceedings
Acceso en línea:Texto completo
Tabla de Contenidos:
  • 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.

Ejemplares similares