Bridging Constraint Satisfaction and Boolean Satisfiability

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 theoretica...

全面介紹

Saved in:
書目詳細資料
主要作者: Petke, Justyna. (Author, http://id.loc.gov/vocabulary/relators/aut)
企業作者: SpringerLink (Online service)
格式: 電子 電子書
語言:English
出版: Cham : Springer International Publishing : Imprint: Springer, 2015.
版:1st ed. 2015.
叢編:Artificial Intelligence: Foundations, Theory, and Algorithms,
主題:
在線閱讀:https://doi.org/10.1007/978-3-319-21810-6
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!