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

詳細記述

保存先:
書誌詳細
第一著者: Petke, Justyna. (著者, http://id.loc.gov/vocabulary/relators/aut)
団体著者: SpringerLink (Online service)
フォーマット: 電子媒体 eBook
言語: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
タグ: タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!

類似資料