Bridging Constraint Satisfaction and Boolean Satisfiability (Artificial Intelligence: Foundations, Theory, and Algorithms) (橋接約束滿足與布林滿足性 (人工智慧：基礎、理論與演算法))

Justyna Petke

Bridging Constraint Satisfaction and Boolean Satisfiability (Artificial Intelligence: Foundations, Theory, and Algorithms)
  • 出版商: Springer
  • 出版日期: 2015-08-19
  • 售價: $2,390
  • 貴賓價: 9.5 折 $2,271
  • 語言: 英文
  • 頁數: 113
  • 裝訂: Hardcover
  • ISBN: 3319218093
  • ISBN-13: 9783319218090
  • 相關分類: 人工智慧、Algorithms-data-structures

    • 海外代購書籍(需單獨結帳)

相關主題

商品描述

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. 

商品描述(中文翻譯)

本書在彌合布林可滿足性（Boolean satisfiability）與約束滿足（constraint satisfaction）領域方面邁出了重要的一步，回答了為什麼 SAT 解算器在某些對標準約束解算器來說難以解決的 CSP 實例上效率高的問題。作者還為選擇特定的 SAT 編碼來處理幾個重要類別的 CSP 實例提供了理論依據。

布林可滿足性和約束滿足作為計算機科學的新領域獨立出現，不同的解決技術已成為這兩個領域問題解決的標準。儘管任何命題公式（SAT）都可以被視為一般約束滿足問題（CSP）的實例，但這一聯繫的含義僅在過去幾年中受到研究。

本書將對人工智慧和理論計算機科學的研究人員及研究生有所幫助。

類似商品