SAT 2005

Satisfiability Research in the Year 2005

By Enrico Giunchiglia , Toby Walsh

SAT 2005 Cover Image

  • ISBN13: 978-1-4020-4552-3
  • 300 Pages
  • User Level: Science
  • Publication Date: January 21, 2007
  • Available eBook Formats: PDF
  • eBook Price: $139.00
Buy eBook Buy Print Book Add to Wishlist
Full Description
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 problems in automated deduction are propositional. Research into methods to automate such reasoning has therefore a long history in artificial intelligence. In 1957, Allen Newell and Herb Simon introduced the Logic Theory Machine to prove propositional theorems from Whitehead and Russel's 'Principia mathematica'. In 1960, Martin Davis and Hillary Putnam introduced their eponymous decision procedure for satisfiability reasoning (though, for space reasons, it was quickly superseded by the modified procedure proposed by Martin Davis, George Logemann and Donald Loveland two years later). In 1971, Stephen Cook's proof that propositional satisfiability is NP-Complete placed satisfiability as the cornerstone of complexity theory.
Table of Contents

Table of Contents

  1. Preface.
  2. 1. Heuristic
  3. Based Backtracking Relaxation for Propositional Satisfiability.
  4. 2. Symbolic Techniques in Satisfiability Solving.
  5. 3. Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas.
  6. 4. Backdoor Sets for DLL Subsolvers.
  7. 5. The Complexity of Pure Literal Elimination.
  8. 6. Clause Weighting Local Search for SAT.
  9. 7. Solving Non
  10. Boolean Satisfiability Problems with Stochastic Local Search: A Comparison of Encodings.
  11. 8. Regular random k
  12. SAT: properties of balanced formulas.
  13. 9. Applying SAT Solving for Classification in Finite Algebra.
  14. 10. The SAT
  15. Based Approch to Separation Logic.
  16. 11. MathSAT: Tight Integration of SAT and Mathematical Decision Procedures.
Errata

Please Login to submit errata.

No errata are currently published