
## References

1. Lauriere, J.L.: ALICE: a language and a program for stating and solving combinatorial problems. artificial intelligence. Artificial Intelligence 10 (1978) 29–127 2. Regin, J.C.: A filtering algorithm for constraints of difference in CSPs. In: Proceedings of ´
the 12th National Conference on AI, Association for Advancement of Artificial Intelligence
(1994) 362–367 3. Leconte, M.: A bounds-based reduction scheme for constraints of difference. In: Proceedings of Second International Workshop on Constraint-based Reasoning (Constraint-96). (1996)
4. Puget, J.: A fast algorithm for the bound consistency of alldiff constraints. In: 15th National Conference on Artificial Intelligence, Association for Advancement of Artificial Intelligence
(1998) 359–366 5. Mehlhorn, K., Thiel, S.: Faster algorithms for bound-consistency of the sortedness and the alldifferent constraint. Sixth International Conference on Principles and Practice of Constraint Programming (2000)
6. Lopez-Ortiz, A., Quimper, C., Tromp, J., van Beek, P.: A fast and simple algorithm for bounds consistency of the alldifferent constraint. In: Proceedings of the 18th International Conference on AI, International Joint Conference on Artificial Intelligence (2003)
7. Stergiou, K., Walsh, T.: The difference all-difference makes. In: Proceedings of 16th IJCAI,
International Joint Conference on Artificial Intelligence (1999)
8. Milano, M., Ottosson, G., Refalo, P., Thorsteinsson, E.: The role of integer programming techniques in constraint programming's global constraints. INFORMS Journal on Computing 14 (2002) 387–402 9. Williams, H., Yan, H.: Representations of the all different predicate of constraint satisfaction in integer programming. INFORMS Journal on Computing 13 (2001) 96–103 10. Walsh, T.: Constraint patterns. In Rossi, F., ed.: 9th International Conference on Principles and Practices of Constraint Programming (CP-2003), Springer (2003)
11. Beldiceanu, N., Bourreau, E., David Rivreau Helmut Simonis Solving Resource-constrained Project Scheduling Problems with CHIP. 5th International Workshop on Project Management and Scheduling (PMS'96), Poznan. (1996) 35–38.

12. Simonis, H.: Building Industrial Applications with Constraint Programming. Constraints in Computational Logics: Theory and Applications, International Summer School, CCL'99, Springer (2001)
13. Debruyne, R., Bessiere, C.: Some practicable filtering techniques for the constraint satisfac- `
tion problem. In: Proceedings of the 15th IJCAI, International Joint Conference on Artificial Intelligence (1997) 412–417 14. Garey, M., Johnson, D., Simons, B., Tarjan, R.: Scheduling unit-time tasks with arbitrary release times and deadlines. SIAM J. Comput. 10 (1981) 256–269 15. Puget, J.F.: Breaking all value symmetries in surjection problems. In van Beek, P., ed.:
Proceedings of 11th International Conference on Principles and Practice of Constraint Programming (CP2005), Springer (2005)
16. Puget, J.F.: Symmetry in injective problems. Constraint Programming Letters 3 (2007) 1–20 17. Mehlhorn, K., Thiel, S.: Faster algorithms for bound-consistency of the sortedness and the alldifferent constraint. In: CP '02: Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming, Springer-Verlag (2000) 306–319 18. Bessiere, C., Katsirelos, G., Narodytska, N., Quimper, C.G., Walsh, T.: Decompositions of all different, global cardinality and related constraints. In: Proceedings of 21st IJCAI,
International Joint Conference on Artificial Intelligence (2009) 419–424 19. Bessiere, C., Katsirelos, G., Narodytska, N., Quimper, C.G., Walsh, T.: Propagating conjunctions of alldifferent constraints. In Fox, M., Poole, D., eds.: Proc. of the Twenty-Fourth AAAI Conference on Artificial Intelligence (AAAI 2010), AAAI Press (2010)