Logo - springer
Slogan - springer

Computer Science - Software Engineering | SAT 2005 - Satisfiability Research in the Year 2005

SAT 2005

Satisfiability Research in the Year 2005

Giunchiglia, Enrico, Walsh, Toby (Eds.)

Reprinted from JOURNAL OF AUTOMATED REASONING,

2006, VII, 293 p.

Available Formats:
eBook
Information

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.

 
$119.00

(net) price for USA

ISBN 978-1-4020-5571-3

digitally watermarked, no DRM

Included Format: PDF

download immediately after purchase


learn more about Springer eBooks

add to marked items

Hardcover
Information

Hardcover version

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$159.00

(net) price for USA

ISBN 978-1-4020-4552-3

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

Softcover
Information

Softcover (also known as softback) version.

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$159.00

(net) price for USA

ISBN 978-94-007-8715-5

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

  • About this book

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.

As this volume demonstrates, research has continued very actively in this area since then. This book follows on from the highly successful volume entitled SAT 2000 published five years ago. The papers in SAT 2005 fall (not entirely neatly) into the following

categories: complete methods, local and stochastic search methods, random problems, applications, and extensions beyond the propositional.

Content Level » Research

Keywords » Automat - Extension - Principia Mathematica - algorithms - artificial intelligence - automated deduction - classification - complexity - complexity theory - intelligence - logic - software verification - verification

Related subjects » Artificial Intelligence - Software Engineering - Theoretical Computer Science

Table of contents 

Preface. 1. Heuristic-Based Backtracking Relaxation for Propositional Satisfiability; Bhalla et al. 2. Symbolic Techniques in Satisfiability Solving; Pan and Vardi. 3. Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas; Alekhnovich et al. 4. Backdoor Sets for DLL Subsolvers; S. Szeider. 5. The Complexity of Pure Literal Elimination; Johannsen. 6. Clause Weighting Local Search for SAT; Thornton. 7. Solving Non-Boolean Satisfiability Problems with Stochastic Local Search: A Comparison of Encodings; Frisch et al. 8. Regular random k-SAT: properties of balanced formulas; Interian and Selman. 9. Applying SAT Solving for Classification in Finite Algebra; Meier and Sorge. 10. The SAT-Based Approch to Separation Logic; Armando et al. 11. MathSAT: Tight Integration of SAT and Mathematical Decision Procedures; Bozzano et al.

Popular Content within this publication 

 

Articles

Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Software Engineering / Programming and Operating Systems.