SAT 2005: Satisfiability Research in the Year 2005
Author:   Enrico Giunchiglia ,  Toby Walsh
Publisher:   Springer-Verlag New York Inc.
Edition:   2006 ed.
ISBN:  

9781402045523


Pages:   293
Publication Date:   30 October 2006
Format:   Hardback
Availability:   Out of print, replaced by POD   Availability explained
We will order this item for you from a manufatured on demand supplier.

Our Price $366.96 Quantity:  
Add to Cart

Share |

SAT 2005: Satisfiability Research in the Year 2005


Add your own review!

Overview

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.

Full Product Details

Author:   Enrico Giunchiglia ,  Toby Walsh
Publisher:   Springer-Verlag New York Inc.
Imprint:   Springer-Verlag New York Inc.
Edition:   2006 ed.
Dimensions:   Width: 15.50cm , Height: 1.70cm , Length: 23.50cm
Weight:   1.320kg
ISBN:  

9781402045523


ISBN 10:   1402045522
Pages:   293
Publication Date:   30 October 2006
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Hardback
Publisher's Status:   Active
Availability:   Out of print, replaced by POD   Availability explained
We will order this item for you from a manufatured on demand supplier.

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.

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

ARG20253

 

Shopping Cart
Your cart is empty
 Shopping cart
Mailing List

 

Sign up now