C. Beeri, R. Fagin, D. Maier, and M. Yannakakis, On the Desirability of Acyclic Database Schemes, Journal of the ACM, vol.30, issue.3, pp.479-513, 1983.
DOI : 10.1145/2402.322389

N. Beldiceanu, M. Carlsson, P. Flener, and J. Pearson, On Matrices, Automata, and Double Counting, CPAIOR 2010, pp.10-24, 2010.
DOI : 10.1007/978-3-642-13520-0_4
URL : https://hal.archives-ouvertes.fr/hal-00915717

N. Beldiceanu, M. Carlsson, and T. Petit, Deriving Filtering Algorithms from Constraint Checkers, CP 2004, pp.107-122, 2004.
DOI : 10.1007/978-3-540-30201-8_11

N. Beldiceanu, M. Carlsson, and J. X. Rampon, Global constraint catalog Available at http://soda.swedish-ict.se/5195/. The current working, Swedish Institute of Computer Science, 2012.

C. Bessì-ere, E. Hebrard, B. Hnich, Z. K?z?ltan, and T. Walsh, SLIDE: A useful special case of the CARDPATH constraint, pp.475-479, 2008.

S. Brand, N. Narodytska, C. G. Quimper, P. J. Stuckey, and T. Walsh, Encodings of the Sequence Constraint, CP 2007, pp.210-224, 2007.
DOI : 10.1007/978-3-540-74970-7_17

M. Carlsson, SICStus Prolog User's Manual. Swedish Institute of Computer Science, 4.0 edn, 2007.

M. C. Côté, B. Gendron, and L. M. Rousseau, Modeling the regular constraint with integer programming, CPAIOR 2007, pp.29-43, 2007.

P. Flener, A. M. Frisch, B. Hnich, Z. K?z?ltan, I. Miguel et al., Breaking Row and Column Symmetries in Matrix Models, CP 2002, pp.462-476, 2002.
DOI : 10.1007/3-540-46135-3_31

A. M. Frisch, B. Hnich, Z. K?z?ltan, I. Miguel, and T. Walsh, Global Constraints for Lexicographic Orderings, CP 2002, pp.93-108, 2002.
DOI : 10.1007/3-540-46135-3_7

A. M. Frisch, B. Hnich, Z. K?z?ltan, I. Miguel, and T. Walsh, Propagation algorithms for lexicographic ordering constraints, Artificial Intelligence, vol.170, issue.10, pp.803-834, 2006.
DOI : 10.1016/j.artint.2006.03.002

A. M. Frisch, C. Jefferson, and I. Miguel, Constraints for Breaking More Row and Column Symmetries, CP 2003, pp.318-332, 2003.
DOI : 10.1007/978-3-540-45193-8_22

R. De-haan, N. Narodytska, and T. Walsh, The RegularGcc Matrix Constraint, p.564, 2012.
DOI : 10.1007/978-3-642-35101-3_18

Y. C. Law and J. H. Lee, Global Constraints for Integer and Set Value Precedence, CP 2004, pp.362-376, 2004.
DOI : 10.1007/978-3-540-30201-8_28

J. Menana and S. Demassey, Sequencing and Counting with the multicost-regular Constraint, CPAIOR 2009, pp.178-192, 2009.
DOI : 10.1007/978-3-642-01929-6_14
URL : https://hal.archives-ouvertes.fr/hal-00394434

J. P. Métivier, P. Boizumault, and S. Loudni, Solving Nurse Rostering Problems Using Soft Global Constraints, CP 2009, pp.73-87, 2009.
DOI : 10.1007/s10732-006-6550-4

G. Pesant, A Regular Language Membership Constraint for Finite Sequences of Variables, CP 2004, pp.482-495, 2004.
DOI : 10.1007/978-3-540-30201-8_36

J. C. Régin and C. Gomes, The Cardinality Matrix Constraint, CP 2004, pp.572-587, 2004.
DOI : 10.1007/978-3-540-30201-8_42

M. Vanhoucke and B. Maenhout, On the characterization and generation of nurse scheduling problem instances, European Journal of Operational Research, vol.196, issue.2, pp.457-467, 2009.
DOI : 10.1016/j.ejor.2008.03.044