Bridging Constraint Satisfaction and Boolean Satisfiability
- Exclusive ContentScan the cover in the app
- CommunityDiscuss & Share
About this book
Why do SAT solvers handle certain families of constraint satisfaction problems with ease when conventional constraint solvers struggle with them? Justyna Petke takes up this question and offers theoretical grounds for preferring one SAT encoding over another across several major classes of CSP instances.
The two fields grew up separately within computer science, each developing its own standard solving methods. Every propositional formula can be read as a CSP instance, yet researchers have only recently begun to explore what that relationship means in practice.
The book is written for researchers and graduate students in artificial intelligence and theoretical computer science.
Reader reviews
No reviews yet. Share your thoughts on this book in the Appilog app.
Book Details
- ISBN
- 9783319373645
- Author
- Justyna Petke
- Publisher
- Unknown Publisher
- Genres
- Science & MathematicsTechnology & Computing
Media & Extras
This book has 0 videos that play on its cover. Scan the cover with the Appilog app to watch.
Get the app
