Bridging constraint satisfaction and Boolean satisfiability [electronic resource]

• 作者： Petke, Justyna.
• 其他作者：
  • SpringerLink (Online service)
• 其他題名：
  • Artificial intelligence: foundations, theory, and algorithms,
• 出版： Cham : Springer International Publishing :Imprint: Springer
• 叢書名： Artificial intelligence: foundations, theory, and algorithms,
• 主題： Constraints (Artificial intelligence) , Algebra, Boolean , Computer science , Artificial Intelligence (incl. Robotics) , Theory of Computation.
• ISBN： 9783319218106 (electronic bk.) 、 9783319218090 (paper)
• FIND@SFXID: CGU
• 資料類型: 電子書
• 內容註: Introduction -- Background -- Solver Performance on Tractable CSPs: Empirical Evaluation -- SAT Encodings -- From CSP to SAT: Width Restrictions -- From CSP to SAT: Language Restrictions -- SAT Encodings of a Classical Problem: A Case Study -- Conclusions.
• More
• 摘要註: 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.
• 讀者標籤：

  需登入
• 引用連結：

  Copy Link
• 目前引用數
• Share: