• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Bridging Constraint Satisfaction and Boolean Satisfiability

Bridging Constraint Satisfaction and Boolean Satisfiability

Paperback

Series: Artificial Intelligence: Foundations, Theory, and Algorithms

General Computers

ISBN10: 3319373641
ISBN13: 9783319373645
Publisher: Springer Nature
Published: Oct 22 2016
Pages: 113
Weight: 0.42
Height: 0.27 Width: 6.14 Depth: 9.21
Language: English

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.

1 different editions

Also available

Also in

General Computers