Fast Set Bounds Propagation Using a BDD-SAT Hybrid
Artificial Intelligence
2014-01-17 v1
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.
Keywords
Cite
@article{arxiv.1401.3846,
title = {Fast Set Bounds Propagation Using a BDD-SAT Hybrid},
author = {Graeme Gange and Peter James Stuckey and Vitaly Lagoon},
journal= {arXiv preprint arXiv:1401.3846},
year = {2014}
}