Bridging constraint satisfaction and Boolean satisfiability [electronic resource] / Justyna Petke.
2015
QA267.7
Linked e-resources
Linked Resource
Online Access
Concurrent users
Unlimited
Authorized users
Authorized users
Document Delivery Supplied
Can lend chapters, not whole ebooks
Details
Title
Bridging constraint satisfaction and Boolean satisfiability [electronic resource] / Justyna Petke.
Author
Petke, Justyna, author.
ISBN
9783319218106 electronic book
3319218107 electronic book
9783319218090
3319218093
3319218107 electronic book
9783319218090
3319218093
Published
Switzerland : Springer, [2015]
Copyright
©2015
Language
English
Description
1 online resource : illustrations
Other Standard Identifiers
10.1007/978-3-319-21810-6 doi
Call Number
QA267.7
Dewey Decimal Classification
511.3
Summary
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. .
Bibliography, etc. Note
Includes bibliographical references.
Access Note
Access limited to authorized users.
Source of Description
Online resource; title from PDF title page (viewed August 27, 2015).
Series
Artificial intelligence (Berlin, Germany)
Available in Other Form
Print version: 9783319218090
Linked Resources
Online Access
Record Appears in
Online Resources > Ebooks
All Resources
All Resources
Table of 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. .
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. .