Advertisement

The All Different and Global Cardinality Constraints on Set, Multiset and Tuple Variables

  • Claude-Guy Quimper
  • Toby Walsh
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3978)

Abstract

We describe how the propagator for the All-Different constraint can be generalized to prune variables whose domains are not just simple finite domains. We show, for example, how it can be used to propagate set variables, multiset variables and variables which represent tuples of values. We also describe how the propagator for the global cardinality constraint (which is a generalization of the All-Different constraint) can be generalized in a similar way. Experiments show that such propagators can be beneficial in practice, especially when the domains are large.

Keywords

Binary Vector Variable Domain Integer Variable Factor Representation Direct Memory Access 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Hall, P.: On representatives of subsets. Journal of the London Mathematical Society, 26–30 (1935)Google Scholar
  2. 2.
    Hopcroft, J., Karp, R.: An n 5/2 algorithm for maximum matchings in bipartite graphs. SIAM Journal of Computing 2, 225–231 (1973)CrossRefMATHGoogle Scholar
  3. 3.
    ILOG S. A.: ILOG Solver 4.2 user’s manual (1998)Google Scholar
  4. 4.
    Régin, J.-C.: A filtering algorithm for constraints of difference in CSPs. In: Proceedings of the Twelfth National Conference on Artificial Intelligence, Seattle, pp. 362–367 (1994)Google Scholar
  5. 5.
    Régin, J.-C.: Generalized arc consistency for global cardinality constraint. In: Proceedings of the Thirteenth National Conference on Artificial Intelligence, Portland, Oregon, pp. 209–215 (1996)Google Scholar
  6. 6.
    Stergiou, K., Walsh, T.: The difference all-difference makes. In: Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, Stockholm, pp. 414–419 (1999)Google Scholar
  7. 7.
    Sadler, A., Gervet, C.: Hybrid Set Domains to Strengthen Constraint Propagation and Reduce Symmetries. In: Proceedings of the 10th International Conference on Principles and Practice of Constraint Programming, Toronto, Canada, pp. 604–618 (2004)Google Scholar
  8. 8.
    Knuth, D.: Generating All Tuples and Permutations, p. 144. Addison-Wesley, Reading (2005)MATHGoogle Scholar
  9. 9.
    López-Ortiz, A., Quimper, C.-G., Tromp, J., van Beek, P.: A fast and simple algorithm for bounds consistency of the alldifferent constraint. In: Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, Acapulco, Mexico, pp. 245–250 (2003)Google Scholar
  10. 10.
    Press, W.H., Flannery, B.P., Teukolsky, S.A., Vetterling, W.T.: Numerical Recipes in C: The Art of Scientific Computing, 2nd edn. Cambridge University Press, Cambridge (1992)MATHGoogle Scholar
  11. 11.
    Régin, J.-C., Gomes, C.P.: The Cardinality Matrix Constraint. In: Proceedings of the 10th International Conference on Principles and Practice of Constraint Programming, Toronto, Canada, pp. 572–587 (2004)Google Scholar
  12. 12.
    Gervet, C.: Interval Propagation to Reason about Sets: Definition and Implementation of a Practical Language. Constraints Journal 1(3), 191–244 (1997)CrossRefMATHGoogle Scholar
  13. 13.
    Gervet, C.: Set Intervals in Constraint Logic Programming: Definition and Implementation of a Language. PhD thesis, Université de Franche-Comté, France, European thesis (September 1995) (in English)Google Scholar
  14. 14.
    Puget, J.-F.: Finite set intervals. In: Proceedings of Workshop on Set Constraints, held at CP 1996 (1996)Google Scholar
  15. 15.
    Müller, T., Müller, M.: Finite set constraints in Oz. In: Bry, F., Freitag, B., Seipel, D. (eds.) 13. Workshop Logische Programmierung, Technische Universität München, September 17–19, 1997, pp. 104–115 (1997)Google Scholar
  16. 16.
    Walsh, T.: Consistency and Propagation with Multiset Constraints: A Formal Viewpoint. In: Proceedings of the 9th International Conference on Principles and Practice of Constraint Programming, Kinsale, Ireland (2003)Google Scholar
  17. 17.
    Gent, I.P., Walsh, T.: CSPLib: a benchmark library for constraints. Technical report APES-09-1999 (1999)Google Scholar
  18. 18.
    Leconte, M.: A bounds-based reduction scheme for constraints of difference. In: Proceedings of the Constraint 1996 International Workshop on Constraint-Based Reasoning, pp. 19–28 (1996)Google Scholar
  19. 19.
    López-Ortiz, A., Quimper, C.-G., Tromp, J., van Beek, P.: A fast and simple algorithm for bounds consistency of the alldifferent constraint. In: Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI 2003), pp. 245–250 (2003)Google Scholar
  20. 20.
    Puget, J.-F.: A Fast Algorithm for the Bound Consistency of Alldiff Constraints. In: Proceedings of the 15th National Conference on Artificiel Intelligence (AAAI 1998) and 10th Conference on Innovation Applications of Artificial Intelligence (IAAI 1998), pp. 359–366 (1998)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Claude-Guy Quimper
    • 1
  • Toby Walsh
    • 2
  1. 1.School of Computer ScienceUniversity of WaterlooCanada
  2. 2.NICTA and UNSWSydneyAustralia

Personalised recommendations