Fast set bounds propagation using a BDD-SAT hybrid
From MaRDI portal
(Redirected from Publication:3579357)
Abstract: Binary Decision Diagram (BDD) based set bounds propagation is a powerful approach to solving set-constraint satisfaction problems. However, prior BDD based techniques in- cur 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.
Recommendations
Cited in
(7)- STR3: a path-optimal filtering algorithm for table constraints
- On the properties of combination set operations.
- Exact stochastic constraint optimisation with applications in network analysis
- MDD propagators with explanation
- scientific article; zbMATH DE number 1956595 (Why is no real title available?)
- scientific article; zbMATH DE number 2243396 (Why is no real title available?)
- Principles and Practice of Constraint Programming – CP 2004
This page was built for publication: Fast set bounds propagation using a BDD-SAT hybrid
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3579357)