SAT 2005 Satisfiability Research in the Year 2005 /

This book is devoted to recent progress made in solving propositional satisfiability and related problems. Propositional satisfiability is a powerful and general formalism used to solve a wide range of important problems including hardware and software verification. The core of many reasoning proble...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor Corporativo: SpringerLink (Online service)
Otros Autores: Giunchiglia, Enrico (Editor ), Walsh, Toby (Editor )
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Dordrecht : Springer Netherlands : Imprint: Springer, 2006.
Edición:1st ed. 2006.
Temas:
Software engineering.
Artificial intelligence.
Computer science.
Software Engineering.
Artificial Intelligence.
Theory of Computation.
Acceso en línea:Texto Completo
Tabla de Contenidos:
  • Satisfiability in the Year 2005
  • Heuristic-Based Backtracking Relaxation for Propositional Satisfiability
  • Symbolic Techniques in Satisfiability Solving
  • Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas
  • Backdoor Sets for DLL Subsolvers
  • The Complexity of Pure Literal Elimination
  • Clause Weighting Local Search for SAT
  • Solving Non-Boolean Satisfiability Problems with Stochastic Local Search: A Comparison of Encodings
  • Regular Random k-SAT: Properties of Balanced Formulas
  • Applying SAT Solving in Classification of Finite Algebras
  • The SAT-based Approach to Separation Logic
  • MathSAT: Tight Integration of SAT and Mathematical Decision Procedures.

Ejemplares similares