Solving set constraint satisfaction problems using ROBDDs

Peter Hawkins, Vitaly Lagoon, Peter J. Stuckey

Research output: Contribution to journalArticleResearchpeer-review

36 Citations (Scopus)


In this paper we present a new approach to modeling finite set domain constraint problems using Reduced Ordered Binary Decision Diagrams (ROBDDs). We show that it is possible to construct an efficient set domain propagator which compactly represents many set domains and set constraints using ROBDDs. We demonstrate that the ROBDD-based approach provides unprecedented flexibility in modeling constraint satisfaction problems, leading to performance improvements. We also show that the ROBDD-based modeling approach can be extended to the modeling of integer and multiset constraint problems in a straightforward manner. Since domain propagation is not always practical, we also show how to incorporate less strict consistency notions into the ROBDD framework, such as set bounds, cardinality bounds and lexicographic bounds consistency. Finally, we present experimental results that demonstrate the ROBDD-based solver performs better than various more conventional constraint solvers on several standard set constraint problems.

Original languageEnglish
Pages (from-to)109-156
Number of pages48
JournalJournal of Artificial Intelligence Research
Publication statusPublished - 1 Jul 2005
Externally publishedYes

Cite this