Fast set bounds propagation using BDDs

Frontiers in Artificial Intelligence and Applications

Volumn 178, Issue , 2008, Pages 505-509

  Gange, Graeme ^a   Lagoon, Vitaly ^a   Stuckey, Peter J ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; CONSTRAINT SATISFACTION PROBLEMS;

ARBITRARY SETS; CONSTRAINT-SATISFACTION PROBLEMS; REDUCED ORDERED BINARY DECISION DIAGRAM; SET CONSTRAINTS; SET VARIABLES;

BINARY DECISION DIAGRAMS;

EID: 77957872318     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: 10.3233/978-1-58603-891-5-505     Document Type: Conference Paper

References (12)

1. Randal E. Bryant, ‘Graph-based algorithms for Boolean function manipulation’, IEEE Trans. Comput., 35(8), 677–691, (1986).
2. R.F. Damiano and J.H. Kukula, ‘Checking satisfiability of a conjunction of BDDs’, in Proceedings of Design Automation Conference, pp. 818–823, (2003).
3. Gecode. www.gecode.org. Accessed Jan 2008.
4. Carmen Gervet, ‘Interval propagation to reason about sets: Definition and implementation of a practical language’, Constraints, 1(3), 191–246, (1997).
5. P. Hawkins, V. Lagoon, and P.J. Stuckey, ‘Set bounds and (split) set domain propagation using ROBDDs’, in 17th Australian Joint Conference on Artificial Intelligence, volume 3339 of LNCS, pp. 706–717, (2004).
6. P. Hawkins, V. Lagoon, and P.J. Stuckey, ‘Solving set constraint satisfaction problems using ROBDDs’, Journal of Artificial Intelligence Research, 24, 106–156, (2005).
7. P. Hawkins and P.J. Stuckey, ‘A hybrid BDD and SAT finite domain constraint solver’, in Proceedings of the 8th International Symposium on Practical Aspects of Declarative Languages, volume 3819 of LNCS, pp. 103–117, (2006).
8. V. Lagoon and P.J. Stuckey, ‘Set domain propagation using ROBDDs’, in Proceedings of the 10th International Conference on Principles and Practice of Constraint Programming, volume 3258 of LNCS, pp. 347–361, (2004).
9. J. H. van Lint and R. M. Wilson, A Course in Combinatorics, Cambridge University Press, 2nd edn., 2001.
10. Fabio Somenzi. CUDD: Colorado University Decision Diagram package. Accessed May 2004. http://vlsi.colorado.edu/ fabio/CUDD/.
11. S. Subbarayan, ‘Efficent reasoning for nogoods in constraint solvers with BDDs’, in Proceedings of Tenth International Symposium on Practical Aspects of Declarative Languages, volume 4902 of LNCS, pp. 53–57, (2008).
12. G. Tack, C. Schulte, and G. Smolka, ‘Generating propagators for finite set constraints’, in Twelfth International Conference on Principles and Practice of Constraint Programming, volume 4204 of LNCS, pp. 575–589, (2006).