株式会社極東書店トップ ＞ 商品一覧 ＞ Bridging Constraint Satisfaction and Boolean Satisfiability. Softcover reprint of the original 1st ed. 2015
商品詳細
Bridging Constraint Satisfaction and Boolean Satisfiability. Softcover reprint of the original 1st ed. 2015
・ISBN 978-3-319-37364-5 paper EUR 49.99
￥13,361.- (税込) ※（※）価格はご注文時の参考価格となります。
納品価格につきましては書籍の入荷時点で確定となります。
版元の原価改定、外国為替の変動等により異なる場合がございますので、予めご了承下さい。
| 著者・編者 | Petke, Justyna, |
|---|---|
| シリーズ | (Artificial Intelligence: Foundations, Theory, and Algorithms) |
| 出版社 | (Springer International Publishing AG, SZ) |
| 出版年月 | 2016 |
| ページ数 | 113 pp. |
| 言語 | ENG |
| ニュース番号 | ＜A02-86055＞ |
解説
This book provides a significant step towards bridging the areas of Boolean satisfiability and constraint satisfaction by answering the question why SAT-solvers are efficient on certain classes of CSP instances which are hard to solve for standard constraint solvers. The author also gives theoretical reasons for choosing a particular SAT encoding for several important classes of CSP instances.
Boolean satisfiability and constraint satisfaction emerged independently as new fields of computer science, and different solving techniques have become standard for problem solving in the two areas. Even though any propositional formula (SAT) can be viewed as an instance of the general constraint satisfaction problem (CSP), the implications of this connection have only been studied in the last few years.
The book will be useful for researchers and graduate students in artificial intelligence and theoretical computer science.