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
标签: 添加标签
没有标签, 成为第一个标记此记录!