by JustynaPetke (Author)
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.
Format: Hardcover
Pages: 128
Edition: 1st ed. 2015
Publisher: Springer
Published: 08 Jan 2016
ISBN 10: 3319218093
ISBN 13: 9783319218090