Solving set constraint satisfaction problems using ROBDDs

Journal of Artificial Intelligence Research

Volumn 24, Issue , 2005, Pages 109-156

  Hawkins, Peter ^a   Lagoon, Vitaly ^a   Stuckey, Peter J ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; DECISION THEORY; PROBLEM SOLVING; SET THEORY;

LEXICOGRAPHY; REDUCED ORDERED BINARY DECISION DIAGRAMS (ROBDD); SE DOMAINS; SET CONSTRAINT PROBLEMS;

CONSTRAINT THEORY;

EID: 31144436005     PISSN: 10769757     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.1638     Document Type: Article

References (25)

1. Andersen, H. R. (1998). An introduction to Binary Decision Diagrams. [Online, accessed 30 July 2004]. http://www.itu.dk/people/hra/notes-index.html.
2. Apt, K. R. (1999). The essence of constraint propagation. Theoretical Computer Science, 221 (1-2), 179-210.
3. Azevedo, F. (2002). Constraint Solving over Multi-valued Logics. Ph.D. thesis, Faculdade de Ciências e Tecnologia, Universidade Nova de Lisboa.
4. Bagnara, R. (1996). A reactive implementation of Pos using ROBDDs. In Procs. of PLILP, Vol. 1140 of LNCS, pp. 107-121. Springer.
5. Bessiere, C., Hebrard, E., Hnich, B., & Walsh, T. (2004). Disjoint, partition and intersection constraints for set and multiset variables. In Wallace, M. (Ed.), Proceedings of the 10th International Conference on Principles and Practice of Constraint Programming, Vol. 3258 of LNCS, pp. 138-152. Springer-Verlag.
6. Bryant, R. E. (1986). Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput., 35(8), 677-691.
7. Bryant, R. E. (1992). Symbolic Boolean manipulation with ordered binary-decision diagrams. ACM Comput. Surv., 24(3), 293-318.
8. Choi, C., Lee, J., & Stuckey, P. J. (2003). Propagation redundancy in redundant modelling. In Rossi, F. (Ed.), Proceedings of the 9th International Conference on Principles and Practices of Constraint Programming, Vol. 2833 of LNCS, pp. 229-243. Springer-Verlag.
9. Gent, I. P., Walsh, T., & Selman, B. (2004). CSPLib: a problem library for constraints. [Online, accessed 24 Jul 2004]. http://www.csplib.org/.
10. Gervet, C. (1997). Interval propagation to reason about sets: Definition and implementation of a practical language. Constraints, 1(3), 191-246.
11. Hawkins, P., Lagoon, V., & Stuckey, P. (2004). Set bounds and (split) set domain propagation using ROBDDs. In Webb, G., & Yu, X. (Eds.), AI 2004: Advances in Artificial Intelligence, 17th Australian Joint Conference on Artificial Intelligence, Vol. 3339 of LNCS, pp. 706-717. Springer-Verlag.
12. Hnich, B., Kiziltan, Z., & Walsh, T. (2002). Modelling a balanced academic curriculum problem. In Proceedings of the Fourth International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, pp. 121-131.
13. IC-PARC (2003). The ECLiPSe constraint logic programming system. [Online, accessed 31 May 2004]. http://www.icparc.ic.ac.uk/eclipse/.
14. ILOG (2004). ILOG Solver. [Online, accessed 30 Aug 2004]. http://www.ilog.com/.
15. Kiziltan, Z., & Walsh, T. (2002). Constraint programming with multisets. In Proceedings of the 2nd International Workshop on Symmetry in Constraint Satisfaction Problems (SymCon-02).
16. Lagoon, V., & Stuckey, P. (2004). Set domain propagation using ROBDDs. In Wallace, M. (Ed.), Proceedings of the 10th International Conference on Principles and Practice of Constraint Programming, Vol. 3258 of LNCS, pp. 347-361. Springer-Verlag.
17. van Lint, J. H., & Wilson, R. M. (2001). A Course in Combinatorics (2nd edition). Cambridge University Press.
18. Mailharro, D. (1998). A classification and constraint-based framework for configuration. Artificial Intelligence for Engineering Design, Analysis and Manufacturing, 12, 383-397.
19. Müller, T. (2001). Constraint Propagation in Mozart. Doctoral dissertation, Universität des Saarlandes, Naturwissenschaftlich-Technische Fakultät I, Fachrichtung Informatik, Saarbrücken, Germany.
20. Müller, T., & Müller, M. (1997). Finite set constraints in Oz. In Bry, F., Freitag, B., & Seipel, D. (Eds.), Workshop Logische Programmierung, Vol. 13. Technische Universität München.
21. Puget, J.-F. (1992). PECOS: a high level constraint programming language. In Proceedings of SPICIS'92, Singapore.
22. Sadler, A., & Gervet, C. (2001). Global reasoning on sets. In FORMUL'01 workshop on modelling and problem formulation, in conjunction with CP'01.
23. Sadler, A., & Gervet, C. (2004). Hybrid set domains to strengthen constraint propagation and reduce symmetries. In Wallace, M. (Ed.), Proceedings of the 10th International Conference on Principles and Practice of Constraint Programming, Vol. 3258 of LNCS, pp. 604-618. Springer-Verlag.
24. Somenzi, F. (2004). CUDD: Colorado University Decision Diagram package. [Online, accessed 31 May 2004]. http://vlsi.colorado.edu/~fabio/CUDD/.
25. Somogyi, Z., Henderson, F., & Conway, T. (1996). The execution algorithm of Mercury, an efficient purely declarative logic programming language. Journal of Logic Programming, 29(1-3), 17-64.