Bridging Constraint Satisfaction and Boolean Satisfiability

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

Full description

Saved in:
Bibliographic Details
Main Author: Petke, Justyna. (Author, http://id.loc.gov/vocabulary/relators/aut)
Corporate Author: SpringerLink (Online service)
Format: Electronic eBook
Language:English
Published: Cham : Springer International Publishing : Imprint: Springer, 2015.
Edition:1st ed. 2015.
Series:Artificial Intelligence: Foundations, Theory, and Algorithms,
Subjects:
Online Access:https://doi.org/10.1007/978-3-319-21810-6
Tags: Add Tag
No Tags, Be the first to tag this record!