Central Library

Normal view MARC view ISBD view

Bridging Constraint Satisfaction and Boolean Satisfiability [electronic resource] / by Justyna Petke.

By: Petke, Justyna [author.].
Contributor(s): SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Artificial Intelligence: Foundations, Theory, and Algorithms: Publisher: Cham : Springer International Publishing : Imprint: Springer, 2015Edition: 1st ed. 2015.Description: XI, 113 p. 19 illus. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783319218106.Subject(s): Computer science | Computers | Artificial intelligence | Computer Science | Artificial Intelligence (incl. Robotics) | Theory of ComputationAdditional physical formats: Printed edition:: No titleDDC classification: 006.3 Online resources: Click here to access online
Contents:
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.    .
In: Springer eBooksSummary: 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.  .
    average rating: 0.0 (0 votes)
No physical items for this record

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

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

There are no comments for this item.

Log in to your account to post a comment.