| 书目名称 | SAT 2005 |
| 副标题 | Satisfiability Resea |
| 编辑 | Enrico Giunchiglia,Toby Walsh |
| 视频video | |
| 概述 | 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 th |
| 图书封面 |  |
| 描述 | .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.. |
| 出版日期 | Conference proceedings 2006 |
| 关键词 | Automat; Extension; Principia Mathematica; algorithms; artificial intelligence; automated deduction; class |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-1-4020-5571-3 |
| isbn_softcover | 978-94-007-8715-5 |
| isbn_ebook | 978-1-4020-5571-3 |
| copyright | Springer Science+Business Media B.V. 2006 |
发表于 2025-3-21 16:28:40
