What a treat! Get Apress Access for just $149 Subscribe now >>

SAT 2005

Satisfiability Research in the Year 2005

Editors: Giunchiglia, Enrico, Walsh, Toby (Eds.)

Buy this book

eBook $139.00
price for USA (gross)
  • ISBN 978-1-4020-5571-3
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover $179.00
price for USA
valid through November 5, 2017
  • ISBN 978-1-4020-4552-3
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Softcover $179.00
price for USA
valid through November 5, 2017
  • ISBN 978-94-007-8715-5
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
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.

Table of contents (2 chapters)

  • The Complexity of Pure Literal Elimination

    Jan Johannsen

    Pages 89-95

  • Applying SAT Solving in Classification of Finite Algebras

    Andreas Meier, Volker Sorge

    Pages 201-235

Buy this book

eBook $139.00
price for USA (gross)
  • ISBN 978-1-4020-5571-3
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover $179.00
price for USA
valid through November 5, 2017
  • ISBN 978-1-4020-4552-3
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Softcover $179.00
price for USA
valid through November 5, 2017
  • ISBN 978-94-007-8715-5
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.

Services for this book

Loading...

Bibliographic Information

Bibliographic Information
Book Title
SAT 2005
Book Subtitle
Satisfiability Research in the Year 2005
Editors
  • Enrico Giunchiglia
  • Toby Walsh
Copyright
2006
Publisher
Springer Netherlands
Copyright Holder
Springer Science+Business Media B.V.
eBook ISBN
978-1-4020-5571-3
DOI
10.1007/978-1-4020-5571-3
Hardcover ISBN
978-1-4020-4552-3
Softcover ISBN
978-94-007-8715-5
Edition Number
1
Number of Pages
VII, 293
Additional Information
Reprinted from JOURNAL OF AUTOMATED REASONING,
Topics