Sciweavers

Share
JAIR
2010

Fast Set Bounds Propagation Using a BDD-SAT Hybrid

9 years 21 days ago
Fast Set Bounds Propagation Using a BDD-SAT Hybrid
Binary Decision Diagram (BDD) based set bounds propagation is a powerful approach to solving set-constraint satisfaction problems. However, prior BDD based techniques incur the significant overhead of constructing and manipulating graphs during search. We present a set-constraint solver which combines BDD-based set-bounds propagators with the learning abilities of a modern SAT solver. Together with a number of improvements beyond the basic algorithm, this solver is highly competitive with existing propagation based set constraint solvers.
Graeme Gange, Peter J. Stuckey, Vitaly Lagoon
Added 28 Jan 2011
Updated 28 Jan 2011
Type Journal
Year 2010
Where JAIR
Authors Graeme Gange, Peter J. Stuckey, Vitaly Lagoon
Comments (0)
books