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...

Full description

Bibliographic Details
Call Number:Libro Electrónico
Corporate Author: SpringerLink (Online service)
Other Authors: Giunchiglia, Enrico (Editor), Walsh, Toby (Editor)
Format: Electronic eBook
Language:Inglés
Published: Dordrecht : Springer Netherlands : Imprint: Springer, 2006.
Edition:1st ed. 2006.
Subjects:
Software engineering.
Artificial intelligence.
Computer science.
Software Engineering.
Artificial Intelligence.
Theory of Computation.
Online Access:Texto Completo
Table of Contents:
  • 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.

Similar Items