Overview
- Presents an up to date snapshot of a very active research area
- Provides many practical applications (especially in the area of hardware verification)
- Presents a survey of the breadth of research in this area
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (12 papers)
-
Front Matter
Keywords
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.
Editors and Affiliations
Bibliographic Information
Book Title: SAT 2005
Book Subtitle: Satisfiability Research in the Year 2005
Editors: Enrico Giunchiglia, Toby Walsh
DOI: https://doi.org/10.1007/978-1-4020-5571-3
Publisher: Springer Dordrecht
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer Science+Business Media B.V. 2006
Hardcover ISBN: 978-1-4020-4552-3Published: 30 October 2006
Softcover ISBN: 978-94-007-8715-5Published: 03 December 2014
eBook ISBN: 978-1-4020-5571-3Published: 21 January 2007
Edition Number: 1
Number of Pages: VII, 293
Additional Information: Reprinted from JOURNAL OF AUTOMATED REASONING,
Topics: Software Engineering/Programming and Operating Systems, Artificial Intelligence, Theory of Computation