Bridging Constraint Satisfaction and Boolean Satisfiability by Justyna PetkeBridging Constraint Satisfaction and Boolean Satisfiability by Justyna Petke

Bridging Constraint Satisfaction and Boolean Satisfiability

byJustyna Petke

Hardcover | August 19, 2015

Pricing and Purchase Info

$115.43 online 
$137.95 list price save 16%
Earn 577 plum® points

Prices and offers may vary in store


In stock online

Ships free on orders over $25

Not available in stores


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. 

Justyna Petke received her D.Phil. from the University of Oxford. She is a Research Associate at the Centre for Research on Evolution, Search and Testing (CREST) in the Dept. of Computer Science, University College London. Her research interests include the connections between constraint satisfaction and search-based software engineeri...
Title:Bridging Constraint Satisfaction and Boolean SatisfiabilityFormat:HardcoverDimensions:113 pagesPublished:August 19, 2015Publisher:Springer-Verlag/Sci-Tech/TradeLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:3319218093

ISBN - 13:9783319218090

Look for similar items by category:


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.