期刊全称 | Bridging Constraint Satisfaction and Boolean Satisfiability |
影响因子2023 | Justyna Petke |
视频video | http://file.papertrans.cn/191/190756/190756.mp4 |
发行地址 | Explains why SAT-solvers are efficient on certain classes of CSPs.Explains which SAT encodings preserve tractability of certain classes of CSPs.Valuable for researchers and graduate students in artifi |
学科分类 | Artificial Intelligence: Foundations, Theory, and Algorithms |
图书封面 |  |
影响因子 | .Thisbook provides a significant step towards bridging the areas of Booleansatisfiability and constraint satisfaction by answering the question whySAT-solversare efficient on certain classes of CSP instances which are hard tosolve for standard constraint solvers. The author also gives theoreticalreasons for choosing a particular SAT encoding for several importantclasses of CSP instances..Booleansatisfiability and constraint satisfaction emerged independently as newfields of computer science, and different solving techniques havebecome standardfor problem solving in the two areas. Even though any propositionalformula (SAT) can be viewed as an instance of the general constraintsatisfaction problem (CSP), the implications of this connection haveonly been studied in the last few years..The book will be useful for researchers and graduate students in artificial intelligence and theoretical computer science. . |
Pindex | Book 2015 |