Enrico Giunchiglia / Toby Walsh (eds.)

SAT 2005

Satisfiability Research in the Year 2005
Herausgegeben:Giunchiglia, Enrico; Walsh, Toby

• Gebundenes Buch

Produktbeschreibung

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.

---

Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.

Produktdetails

• Verlag: Springer / Springer Netherlands
• Artikelnr. des Verlages: 11381372, 978-1-4020-4552-3
• 2006 edition
• Seitenzahl: 293
• Erscheinungstermin: 30. Oktober 2006
• Englisch
• Abmessung: 244mm x 163mm x 25mm
• Gewicht: 592g
• ISBN-13: 9781402045523
• ISBN-10: 1402045522
• Artikelnr.: 22570027

Autorenporträt

Enrico Giunchiglia, Università di Genova, Italy / Toby Walsh, National ICT Australia and University of New South Wales, Sydney, Australia

Inhaltsangabe

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.