- 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. Heuristic
- Based Backtracking Relaxation for Propositional Satisfiability.
- 2. Symbolic Techniques in Satisfiability Solving.
- 3. Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas.
- 4. Backdoor Sets for DLL Subsolvers.
- 5. The Complexity of Pure Literal Elimination.
- 6. Clause Weighting Local Search for SAT.
- 7. Solving Non
- Boolean Satisfiability Problems with Stochastic Local Search: A Comparison of Encodings.
- 8. Regular random k
- SAT: properties of balanced formulas.
- 9. Applying SAT Solving for Classification in Finite Algebra.
- 10. The SAT
- Based Approch to Separation Logic.
- 11. MathSAT: Tight Integration of SAT and Mathematical Decision Procedures.
If you think that you've found an error in this book, please let us know about it. You will find any confirmed erratum below, so you can check if your concern has already been addressed.No errata are currently published