H. Reif-andersen, T. Hadzic, J. N. Hooker, and P. Tiedemann, A Constraint Store Based on Multivalued Decision Diagrams, CP, pp.118-132, 2007.
DOI : 10.1007/978-3-540-74970-7_11

D. Bergman, W. J. Van-hoeve, and J. N. Hooker, Manipulating MDD Relaxations for Combinatorial Optimization, CPAIOR, pp.20-35, 2011.
DOI : 10.1007/978-3-642-21311-3_5

C. Bessière and J. Régin, Arc consistency for general constraint networks: preliminary results, Proceedings of IJCAI'97, pp.398-404, 1997.

C. Bessière and J. Régin, Refining the basic constraint propagation algorithm, Proceedings of IJCAI'01, pp.309-315, 2001.

P. Briggs and L. Torczon, An efficient representation for sparse sets, ACM Letters on Programming Languages and Systems, vol.2, issue.1-4, pp.59-69, 1993.
DOI : 10.1145/176454.176484

R. E. Bryant, Graph-Based Algorithms for Boolean Function Manipulation, IEEE Transactions on Computers, vol.35, issue.8, pp.35677-691, 1986.
DOI : 10.1109/TC.1986.1676819

K. Cheng and R. Yap, An MDD-based generalized arc consistency algorithm for positive and negative table constraints and some global constraints, Constraints, vol.177, issue.2???3, p.15, 2010.
DOI : 10.1007/s10601-009-9087-y

C. K. Kenil, R. H. Cheng, and . Yap, Maintaining generalized arc consistency on ad hoc r-ary constraints, CP, pp.509-523, 2008.

I. Gent, C. Jefferson, I. Miguel, and P. Nightingale, Data structures for generalised arc consistency for extensional constraints, Proc. AAAI'07, pp.191-197, 2007.

T. Hadzic, J. N. Hooker, O. Barry, P. Sullivan, and . Tiedemann, Approximate Compilation of Constraints into Multivalued Decision Diagrams, CP, pp.448-462, 2008.
DOI : 10.1007/978-3-540-85958-1_30

S. Hoda, W. J. Van-hoeve, and J. N. Hooker, A systematic approach to mddbased constraint programming, CP, pp.266-280, 2010.

G. Katsirelos and T. Walsh, A Compression Algorithm for Large Arity Extensional Constraints, Proc. CP'07, pp.379-393, 2007.
DOI : 10.1007/978-3-540-74970-7_28

C. Lecoutre, STR2: optimized simple tabular reduction for table constraints, Constraints, vol.171, issue.8???9, pp.341-371, 2011.
DOI : 10.1007/s10601-011-9107-6

URL : https://hal.archives-ouvertes.fr/hal-00868225

C. Lecoutre, C. Likitvivatanavong, and R. H. Yap, A path-optimal gac algorithm for table constraints, ECAI, pp.510-515, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00873051

O. Lhomme and J. Régin, A fast arc consistency algorithm for n-ary constraints, Proc. AAAI'05, pp.405-410, 2005.

O. Lhomme, Practical reformulations with table constraints, ECAI, pp.911-912, 2012.

J. Mairy, P. Van-hentenryck, and Y. Deville, Optimal and efficient filtering algorithms for table constraints, Constraints, vol.171, issue.8???9, pp.77-120, 2014.
DOI : 10.1007/s10601-013-9156-0

R. Mohr and G. Masini, Good old discrete relaxation, Proceedings of ECAI-88, pp.651-656, 1988.
URL : https://hal.archives-ouvertes.fr/inria-00548479

J. Régin, AC-*: A Configurable, Generic and Adaptive Arc Consistency Algorithm, CP, pp.505-519, 2005.
DOI : 10.1007/11564751_38

J. Régin, Improving the expressiveness of table constraints, CP'11, proceedings workshop ModRef'11, 2011.

M. Rice and S. Kulhari, A survey of static variable ordering heuristics for efficient bdd/mdd construction, 2008.