株式会社極東書店トップ ＞ 商品一覧 ＞ SAT 2005: Satisfiability Research in the Year 2005. 2006 ed.
商品詳細
SAT 2005: Satisfiability Research in the Year 2005. 2006 ed.
・ISBN 978-1-4020-4552-3 hard EUR 149.99
￥40,091.- (税込) ※（※）価格はご注文時の参考価格となります。
納品価格につきましては書籍の入荷時点で確定となります。
版元の原価改定、外国為替の変動等により異なる場合がございますので、予めご了承下さい。
| 著者・編者 | Giunchiglia, Enrico / Walsh, Toby (eds.), |
|---|---|
| 出版社 | (Springer-Verlag New York Inc., US) |
| 出版年月 | 2006 |
| ページ数 | 293 pp. |
| 言語 | ENG |
| ニュース番号 | ＜A05-27043＞ |
解説
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.