Abstract
It is well-known that SAT-solvers are remarkably efficient. However, little is known as to why this is the case. In this book we have tried to answer this question by investigating the connections between constraint satisfaction and Boolean satisfiability problems.
“Poirot,” I said. “I have been thinking.”
“An admirable exercise my friend. Continue it.”
Agatha Christie
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsBibliography
M.C. Cooper, D.A. Cohen, and P. Jeavons. Characterising tractable constraints. Artificial Intelligence, 65:347–361, 1994.
S. Živný and P. Jeavons. Classes of submodular constraints expressible by graph cuts. Constraints, 15(3):430–452, 2010.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Petke, J. (2015). Conclusions. In: Bridging Constraint Satisfaction and Boolean Satisfiability. Artificial Intelligence: Foundations, Theory, and Algorithms. Springer, Cham. https://doi.org/10.1007/978-3-319-21810-6_8
Download citation
DOI: https://doi.org/10.1007/978-3-319-21810-6_8
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-21809-0
Online ISBN: 978-3-319-21810-6
eBook Packages: Computer ScienceComputer Science (R0)