Fast Set Bounds Propagation using BDDs

Authors:
Graeme Gange;Vitaly Lagoon;Peter J. Stuckey
Affiliations:
Department of Computer Science and Software Engineering, The University of Melbourne, Vic. 3010, Australia;Department of Computer Science and Software Engineering, The University of Melbourne, Vic. 3010, Australia;NICTA Victoria Laboaratory, Department of Computer Science and Software Engineering, The University of Melbourne, Vic. 3010, Australia
Venue:
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Year:
2008

Citing 7
Cited 3

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Checking satisfiability of a conjunction of BDDs

Proceedings of the 40th annual Design Automation Conference
Solving set constraint satisfaction problems using ROBDDs

Journal of Artificial Intelligence Research
Efficient reasoning for nogoods in constraint solvers with BDDs

PADL'08 Proceedings of the 10th international conference on Practical aspects of declarative languages
Generating propagators for finite set constraints

CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
A hybrid BDD and SAT finite domain constraint solver

PADL'06 Proceedings of the 8th international conference on Practical Aspects of Declarative Languages
Set bounds and (split) set domain propagation using ROBDDs

AI'04 Proceedings of the 17th Australian joint conference on Advances in Artificial Intelligence

Fast set bounds propagation using a BDD-SAT hybrid

Journal of Artificial Intelligence Research
MDD propagators with explanation

Constraints
A constraint propagation approach to structural model based image segmentation and recognition

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Set bounds propagation is the most popular approach to solving constraint satisfaction problems (CSPs) involving set variables. The use of reduced ordered Binary Decision Diagrams (BDDs) to represent and solve set CSPs is well understood and brings the advantage that propagators for arbitrary set constraints can be built. This can substantially improve solving. The disadvantages of BDDs is that creating and manipulating BDDs can be expensive. In this paper we show how we can perform set bounds propagation using BDDs in a much more efficient manner by generically creating set constraint predicates, and using a marking approach to propagation. The resulting system can be significantly faster than competing approaches to set bounds propagation.