Set Bounds and (Split) Set Domain Propagation Using ROBDDs

  • Peter Hawkins
  • Vitaly Lagoon
  • Peter J. Stuckey
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3339)


Most propagation-based set constraint solvers approximate the set of possible sets that a variable can take by upper and lower bounds, and perform so-called set bounds propagation. However Lagoon and Stuckey have shown that using reduced ordered binary decision diagrams (ROBDDs) one can create a practical set domain propagator that keeps all information (possibly exponential in size) about the set of possible set values for a set variable. In this paper we first show that we can use the same ROBDD approach to build an efficient bounds propagator. The main advantage of this approach to set bounds propagation is that we need not laboriously determine set bounds propagations rules for each new constraint, they can be computed automatically. In addition we can eliminate intermediate variables, and build stronger set bounds propagators than with the usual approach. We then show how we can combine this with the set domain propagation approach of Lagoon and Stuckey to create a more efficient set domain propagation solver.


Boolean Function Boolean Variable Global Constraint Intermediate Variable Steiner Triple System 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Azevedo, F.: Constraint Solving over Multi-valued Logics. PhD thesis, Faculdade de Ciências e Tecnologia, Universidade Nova de Lisboa (2002)Google Scholar
  2. 2.
    Bagnara, R.: A reactive implementation of Pos using ROBDDs. In: Kuchen, H., Swierstra, S.D. (eds.) PLILP 1996. LNCS, vol. 1140, pp. 107–121. Springer, Heidelberg (1996)Google Scholar
  3. 3.
    Bryant, R.E.: Symbolic Boolean manipulation with ordered binary-decision diagrams. ACM Comput. Surv., 24(3):293–318, ISSN 0360-0300 (1992),
  4. 4.
    Gervet, C.: Interval propagation to reason about sets: Definition and implementation of a practical language. Constraints 1(3), 191–246 (1997)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    IC-PARC. The ECLiPSe constraint logic programming system. [Online, accessed 31 May 2004] (2003),
  6. 6.
    Lagoon, V., Stuckey, P.: Set domain propagation using ROBDDs. In: Wallace, M. (ed.) Procs. of the 8th Int. Conf. on Constraint Programming. LNCS, Springer-Verlag, Heidelberg (2004)(to appear) Also at
  7. 7.
    Puget, J.-F.: PECOS: a high level constraint programming language. In: Proceedings of SPICIS 1992, Singapore (1992)Google Scholar
  8. 8.
    Somenzi, F.: CUDD: Colorado University Decision Diagram package. [Online, accessed 31 May 2004] (February 2004),
  9. 9.
    Somogyi, Z., Henderson, F., Conway, T.: The execution algorithm of Mercury, an efficient purely declarative logic programming language. Journal of Logic Programming 29(1–3), 17–64 (1996)zbMATHCrossRefGoogle Scholar
  10. 10.
    van Lint, J.H., Wilson, R.M.: A Course in Combinatorics, 2nd edn. Cambridge University Press, Cambridge (2001)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Peter Hawkins
    • 1
  • Vitaly Lagoon
    • 1
  • Peter J. Stuckey
    • 1
  1. 1.Department of Computer Science and Software EngineeringThe University of MelbourneAustralia

Personalised recommendations