J. Amilhastre, H. Fargier, and P. Marquis, Consistency restoration and explanations in dynamic CSPs?Application to configuration, Artificial Intelligence, vol.135, issue.1-2, pp.199-234, 2002.

H. R. Andersen, T. Hadzic, J. N. Hooker, and P. Tiedemann, A Constraint Store Based on Multivalued Decision Diagrams, Principles and Practice of Constraint Programming ? CP 2007, pp.118-132

K. Apt, Principles of Constraint Programming, 2003.

S. Arnborg, Efficient algorithms for combinatorial problems on graphs with bounded decomposability ? A survey, BIT, vol.25, issue.1, pp.1-23, 1985.

N. Beldiceanu, M. Carlsson, R. Debruyne, and T. Petit, Reformulation of Global Constraints Based on Constraints Checkers, Constraints, vol.10, issue.4, pp.339-362, 2005.

N. Beldiceanu, M. Carlsson, J. Rampon, and C. Truchet, Graph Invariants as Necessary Conditions for Global Constraints, Principles and Practice of Constraint Programming - CP 2005, pp.92-106, 2005.

N. Beldiceanu and H. Simonis, A Constraint Seeker: Finding and Ranking Global Constraints from Examples, Principles and Practice of Constraint Programming ? CP 2011, pp.12-26, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00754010

B. Benhamou, Principles and Practice of Constraint Programming, Proceedings PPCP'94, pp.249-257, 1994.
URL : https://hal.archives-ouvertes.fr/hal-00482221

F. Benhamou and L. Granvilliers, Continuous and Interval Constraints, Handbook of Constraint Programming, pp.571-603, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00480814

H. Bennaceur and M. Affane, Partition-k-AC: An Efficient Filtering Technique Combining Domain Partition and Arc Consistency, Principles and Practice of Constraint Programming ? CP 2001, pp.560-564, 2001.

D. Bergman, A. A. Cire, and W. J. Van-hoeve, MDD Propagation for Sequence Constraints, Journal of Artificial Intelligence Research, vol.50, pp.697-722, 2014.

P. Berlandier, Improving domain filtering using restricted path consistency, Proceedings the 11th Conference on Artificial Intelligence for Applications

U. Bertelé and F. Brioshi, Chapter 1 Nonserial Problems, Mathematics in Science and Engineering, pp.1-17, 1972.

C. Bessiére, E. C. Freuder, and J. Regin, Using constraint metaknowledge to reduce arc consistency computation, Artificial Intelligence, vol.107, issue.1, pp.125-148, 1999.

C. Bessiere, E. Hebrard, B. Hnich, Z. Kiziltan, and T. Walsh, Filtering Algorithms for the NValue Constraint, Constraints, vol.11, issue.4, pp.271-293, 2006.
URL : https://hal.archives-ouvertes.fr/lirmm-00135540

C. Bessiere, E. Hebrard, B. Hnich, and T. Walsh, The Complexity of Reasoning with Global Constraints, Constraints, vol.12, issue.2, pp.239-259, 2006.
URL : https://hal.archives-ouvertes.fr/lirmm-00195881

C. Bessiere, G. Katsirelos, N. Narodytska, W. , and T. , Circuit complexity and decompositions of global constraints, Proceedings IJCAI'09, pp.412-418, 2009.
URL : https://hal.archives-ouvertes.fr/lirmm-00382608

C. Bessiere, L. De-raedt, T. Guns, L. Kotthoff, M. Nanni et al., The Inductive Constraint Programming Loop, IEEE Intelligent Systems, vol.32, issue.5, pp.1-1, 2017.
URL : https://hal.archives-ouvertes.fr/hal-02310649

C. Bessière and J. Régin, MAC and combined heuristics: Two reasons to forsake FC (and CBJ?) on hard problems, Lecture Notes in Computer Science, pp.61-75, 1996.

C. Bessiere and J. Regin, An arc-consistency algorithm optimal in the number of constraint checks, Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94, pp.309-315

C. Bessière, J. Régin, R. H. Yap, and Y. Zhang, An optimal coarse-grained arc consistency algorithm, Artificial Intelligence, vol.165, issue.2, pp.165-185, 2005.

F. Boussemart, F. Hemery, C. Lecoutre, and L. Sais, Support Inference for Generic Filtering, Principles and Practice of Constraint Programming ? CP 2004, pp.721-725, 2004.

A. A. Bulatov, A Dichotomy Theorem for Nonuniform CSPs, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), pp.319-330, 2017.

A. A. Bulatov and V. Dalmau, A Simple Algorithm for Mal'tsev Constraints, SIAM Journal on Computing, vol.36, issue.1, pp.16-27, 2006.

B. Cabon, S. D. Givry, L. Lobjois, T. Schiex, and J. P. Warners, Radio link frequency assignment, Constraints, vol.4, issue.1, pp.79-89, 1999.
URL : https://hal.archives-ouvertes.fr/hal-02695373

C. Carbonnel, The Dichotomy for Conservative Constraint Satisfaction is Polynomially Decidable, Lecture Notes in Computer Science, pp.130-146, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01413124

H. Chen, V. Dalmau, and B. Grussien, Arc consistency and friends, Journal of Logic and Computation, vol.23, issue.1, pp.87-108, 2011.

B. M. Cheng, J. H. Lee, and J. C. Wu, A nurse rostering system using constraint programming and redundant modeling, IEEE Transactions on Information Technology in Biomedicine, vol.1, issue.1, pp.44-54, 1997.

D. A. Cohen and P. G. Jeavons, The power of propagation: when GAC is enough, Constraints, vol.22, issue.1, pp.3-23, 2016.

M. Cooper, Fundamental properties of neighbourhood substitution in constraint satisfaction problems, Artificial Intelligence, vol.90, issue.1-2, pp.1-24, 1997.

M. C. Cooper, D. A. Cohen, and P. G. Jeavons, Characterising tractable constraints, Artificial Intelligence, vol.65, issue.2, pp.347-361, 1994.

T. Dao, K. Duong, and C. Vrain, Constrained clustering by constraint programming, Artificial Intelligence, vol.244, pp.70-94, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01162640

R. Debruyne and C. Bessière, From restricted path consistency to max-restricted path consistency, Principles and Practice of Constraint Programming-CP97, pp.312-326, 1997.

R. Debruyne and C. Bessiere, Domain Filtering Consistencies, Journal of Artificial Intelligence Research, vol.14, pp.205-230, 2001.

R. Dechter, Tractable Structures for Constraint Satisfaction Problems, Handbook of Constraint Programming, pp.209-244, 2006.

R. Dechter, Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition, Artificial Intelligence, vol.41, pp.273-312, 1990.

R. Dechter and A. Dechter, Introduction, Constraint Processing, pp.1-22, 2003.

R. Dechter and J. Pearl, Network-based heuristics for constraint-satisfaction problems, Artificial Intelligence, vol.34, pp.1-38, 1988.

R. Dechter and J. Pearl, Tree clustering for constraint networks, Artificial Intelligence, vol.38, pp.353-366, 1989.

R. Dechter and P. Van-beek, Local and global relational consistency. Theoretical Computer Science, vol.173, pp.283-308, 1997.

J. Demeulenaere, R. Hartert, C. Lecoutre, G. Perez, L. Perron et al., Compact-Table: Efficiently Filtering Table Constraints with Reversible Sparse Bit-Sets, Lecture Notes in Computer Science, pp.207-223, 2016.

Y. Deville, O. Barette, and P. Van-hentenryck, Constraint satisfaction over connected row-convex constraints, Artificial Intelligence, vol.109, issue.1-2, pp.243-271, 1999.

M. Dincbas, P. Van-hentenryck, H. Simonis, A. , and A. , The constraint logic programming language chip, Proceedings of the International Conference on Fifth Generation Computer Systems, pp.693-702, 1988.

B. Faltings and S. Macho-gonzalez, Open constraint programming, Artificial Intelligence, vol.161, issue.1-2, pp.181-208, 2005.

H. Fargier, J. Lang, and T. Schiex, Mixed constraint satisfaction: a framework for decision problems under incomplete knowledge, Proceedings AAAI'96, pp.175-180, 1996.
URL : https://hal.archives-ouvertes.fr/hal-02770543

T. Feder and M. Y. Vardi, The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory, SIAM Journal on Computing, vol.28, issue.1, pp.57-104, 1998.

R. Fikes, REF-ARF: A system for solving problems stated as procedures, Artificial Intelligence, vol.1, issue.1-2, pp.27-120, 1970.

E. Freuder, Synthesizing constraint expressions, Communications of the ACM, vol.21, issue.11, pp.958-966, 1978.

E. Freuder, A sufficient condition for backtrack-free search, Journal of the ACM, vol.29, issue.1, pp.24-32, 1982.

E. Freuder, A sufficient condition for backtrack-bounded search, Journal of the ACM, vol.32, issue.4, pp.755-761, 1985.

E. Freuder and R. Wallace, Replaceability and the Substitutability Hierarchy for Constraint Satisfaction Problems, Proceedings AAAI'90, pp.4-9

E. Freuder and R. Wallace, Replaceability and the Substitutability Hierarchy for Constraint Satisfaction Problems, Proceedings AAAI'91, pp.227-233

E. Freuder and C. Elfe, Neighborhood inverse consistency preprocessing, Proceedings AAAI'96, pp.202-208, 1996.

E. Freuder and R. Wallace, Partial constraint satisfaction, Artificial Intelligence, vol.58, pp.21-70, 1992.

J. Gaschnig, A constraint satisfaction method for inference making, Proceedings Twelfth Annual Allerton Conference on Circuit and System Theory, pp.866-874, 1974.

J. Gaschnig, Experimental case studies of backtrack vs waltz-type vs new algorithms for satisficing assignment problems, Proceedings Second Canadian Conference on Artificial Intelligence, pp.268-277, 1978.

J. Gaschnig, Performance measurement and analysis of certain search algorithms, 1979.

C. Gaspin and E. Westhof, The determination of the secondary structures of ribonucleic acids as a constraint satisfaction problem, IEEE Colloquium on Molecular BioInformatics, 1994.
URL : https://hal.archives-ouvertes.fr/hal-02845291

I. P. Gent, K. E. Petrie, and J. Puget, Symmetry in Constraint Programming, Handbook of Constraint Programming, pp.329-376, 2006.

C. Gervet, Conjunto: Constraint propagation over set constraints with finite set domain variables, Logic Programming, pp.339-358, 1994.

C. Gervet and P. Van-hentenryck, Length-lex ordering for set csps, Proceedings AAAI'06, pp.48-53, 2006.
URL : https://hal.archives-ouvertes.fr/hal-01742384

S. W. Golomb and L. D. Baumert, Backtrack Programming, Journal of the ACM, vol.12, issue.4, pp.516-524, 1965.

C. P. Gomes, C. Fernández, B. Selman, and C. Bessière, Statistical Regimes Across Constrainedness Regions, Constraints, vol.10, issue.4, pp.317-337, 2005.
URL : https://hal.archives-ouvertes.fr/lirmm-00108914

C. P. Gomes, B. Selman, and N. Crato, Heavy-tailed distributions in combinatorial search, Principles and Practice of Constraint Programming-CP97, pp.121-135, 1997.

G. Gottlob, N. Leone, and F. Scarcello, A comparison of structural CSP decomposition methods, Artificial Intelligence, vol.124, issue.2, pp.243-282, 2000.

T. Guns, S. Nijssen, and L. De-raedt, Itemset mining: A constraint programming perspective, Artificial Intelligence, vol.175, issue.12-13, pp.1951-1983, 2011.

M. Gyssens, P. G. Jeavons, and D. A. Cohen, Decomposing constraint satisfaction problems using database techniques, Artificial Intelligence, vol.66, issue.1, pp.57-89, 1994.

R. M. Haralick and G. L. Elliott, Increasing tree search efficiency for constraint satisfaction problems, Artificial Intelligence, vol.14, issue.3, pp.263-313, 1980.

W. Harvey and M. Ginsberg, Limited discrepancy search, Proceedings IJCAI'95, pp.607-613, 1995.

S. Hoda, W. J. Van-hoeve, and J. N. Hooker, A Systematic Approach to MDD-Based Constraint Programming, Principles and Practice of Constraint Programming ? CP 2010, pp.266-280, 2010.

. Ilog, User's manual, 1997.

P. Janssen, P. Jegou, B. Nouguier, and M. C. Vilarem, A filtering process for general constraint-satisfaction problems: achieving pairwise-consistency using an associated binary representation, [Proceedings 1989] IEEE International Workshop on Tools for Artificial Intelligence, pp.420-427

P. Janssen and M. Vilarem, Problèmes de satisfaction de contraintes : techniques de résolution et applicationà la synthèse de peptides, CRIM, 1988.

P. Jeavons, D. Cohen, and M. C. Cooper, Constraints, consistency and closure, Artificial Intelligence, vol.101, issue.1-2, pp.251-265, 1998.

P. G. Jeavons and M. C. Cooper, Tractable constraints on ordered domains, Artificial Intelligence, vol.79, issue.2, pp.327-339, 1995.

P. Jégou, On the consistency of general constraint-satisfaction problems, Proceedings AAAI'93, pp.114-119, 1993.

P. Jégou and C. Terrioux, Hybrid backtracking bounded by tree-decomposition of constraint networks, Artificial Intelligence, vol.146, issue.1, pp.43-75, 2003.

G. Katsirelos and F. Bacchus, Unrestricted Nogood Recording in CSP Search, Principles and Practice of Constraint Programming ? CP 2003, pp.873-877, 2003.

R. Korf, Improved limited discrepancy search, Proceedings AAAI'96, pp.286-291, 1996.

J. Laurière, A language and a program for stating and solving combinatorial problems, Artificial Intelligence, vol.10, issue.1, pp.29-127, 1978.

C. Lecoutre, STR2: optimized simple tabular reduction for table constraints, Constraints, vol.16, issue.4, pp.341-371, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00868225

C. Lecoutre, F. Boussemart, and F. Hemery, Exploiting Multidirectionality in Coarse-Grained Arc Consistency Algorithms, Principles and Practice of Constraint Programming ? CP 2003, pp.480-494, 2003.

C. Lecoutre, C. Likitvivatanavong, and R. H. Yap, STR3: A path-optimal filtering algorithm for table constraints, Artificial Intelligence, vol.220, pp.1-27, 2015.

C. Lecoutre, L. Saïs, S. Tabary, and V. Vidal, Reasoning from last conflict(s) in constraint programming, Artificial Intelligence, vol.173, issue.18, pp.1592-1614, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00868108

C. Lecoutre, L. Saïs, S. Tabary, and V. Vidal, Recording and Minimizing Nogoods from Restarts, Journal on Satisfiability, Boolean Modeling and Computation, vol.1, issue.3-4, pp.147-167, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00191092

O. Lhomme, Consistency techniques for numeric CSPs, Proceedings IJCAI'93, pp.232-238, 1993.

M. Lombardi, M. Milano, and A. Bartolini, Empirical decision model learning, Artificial Intelligence, vol.244, pp.343-367, 2017.

M. Luby, A. Sinclair, and D. Zuckerman, Optimal speedup of Las Vegas algorithms, Information Processing Letters, vol.47, issue.4, pp.173-180, 1993.

A. Mackworth, Consistency in networks of relations, Artificial Intelligence, vol.8, issue.1, pp.99-118, 1977.

A. Mackworth, On reading sketch maps, Proceedings IJCAI'77, pp.598-606, 1977.

P. Marquis, O. Papini, and H. Prade, De la Religion, considérée dans sa source, ses formes et ses développements. 1824, De la Religion, considérée dans sa source, ses formes et ses développements, Tome I, pp.29-84, 2013.

P. Marquis, O. Papini, and H. Prade, A Guided Tour of Artificial Intelligence Research, Artificial Intelligence Research, vol.II, 2020.

P. Martin and D. B. Shmoys, A new approach to computing optimal schedules for the job-shop scheduling problem, Integer Programming and Combinatorial Optimization, pp.389-403, 1996.

D. Mehta, B. O?sullivan, and L. Quesada, Value Ordering for Finding All Solutions: Interactions with Adaptive Variable Ordering, Principles and Practice of Constraint Programming ? CP 2011, pp.606-620, 2011.

P. Meseguer, The IJCAI-97 Workshop on Computer Games, ICGA Journal, vol.20, issue.1, pp.54-55, 1997.

L. Michel and P. Van-hentenryck, Activity-Based Search for Black-Box Constraint Programming Solvers, Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems, pp.228-243, 2012.

R. Mohr and T. C. Henderson, Arc and path consistency revisited, Artificial Intelligence, vol.28, issue.2, pp.225-233, 1986.
URL : https://hal.archives-ouvertes.fr/inria-00548487

R. Mohr and G. Masini, ECAI-88, AI Communications, vol.1, issue.1, pp.57-60, 1988.

U. Montanari, Networks of constraints: Fundamental properties and applications to picture processing, Information Sciences, vol.7, pp.95-132, 1974.

B. Nadel, Tree Search and ARC Consistency in Constraint Satisfaction Algorithms, Search in Artificial Intelligence, pp.287-342, 1988.

O. Ohrimenko, P. J. Stuckey, and M. Codish, Propagation via lazy clause generation, Constraints, vol.14, issue.3, pp.357-391, 2009.

G. Pesant, A Regular Language Membership Constraint for Finite Sequences of Variables, Principles and Practice of Constraint Programming ? CP 2004, pp.482-495, 2004.

P. Prosser, HYBRID ALGORITHMS FOR THE CONSTRAINT SATISFACTION PROBLEM, Computational Intelligence, vol.9, issue.3, pp.268-299, 1993.

P. Refalo, Impact-Based Search Strategies for Constraint Programming, Principles and Practice of Constraint Programming ? CP 2004, pp.557-571, 2004.

J. Régin, A filtering algorithm for constraints of difference in CSPs, Proceedings AAAI'94, pp.362-367, 1994.

J. Régin, Generalized arc consistency for global cardinality constraint, Proceedings AAAI'96, pp.209-215, 1996.

D. Sabin and E. C. Freuder, Contradicting conventional wisdom in constraint satisfaction, Lecture Notes in Computer Science, pp.10-20, 1994.

P. Schaus, J. O. Aoga, and T. Guns, CoverSize: A Global Constraint for Frequency-Based Itemset Mining, Lecture Notes in Computer Science, pp.529-546, 2017.

T. Schiex, H. Fargier, and G. Verfaillie, Valued constraint satisfaction problems: hard and easy problems, Proceedings IJCAI'95, pp.631-637, 1995.
URL : https://hal.archives-ouvertes.fr/hal-02778456

T. Schiex and G. Verfaillie, Nogood Recording for static and dynamic constraint satisfaction problems, Proceedings of 1993 IEEE Conference on Tools with Al (TAI-93), pp.48-55
URL : https://hal.archives-ouvertes.fr/hal-02847674

P. Shaw, Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems, Principles and Practice of Constraint Programming ? CP98, pp.417-431, 1998.

M. Siala, Search, propagation, and learning in sequencing and scheduling problems, Constraints, vol.20, issue.4, pp.479-480, 2015.
URL : https://hal.archives-ouvertes.fr/tel-01164291

W. Ugarte, P. Boizumault, B. Crémilleux, A. Lepailleur, S. Loudni et al., Skypattern mining: From pattern condensed representations to dynamic constraint satisfaction problems, Artificial Intelligence, vol.244, pp.48-69, 2017.
URL : https://hal.archives-ouvertes.fr/hal-02048224

J. Ullmann, Partition search for non-binary constraint satisfaction, Information Sciences, vol.177, issue.18, pp.3639-3678, 2007.

P. Van-beek and R. Dechter, On the minimality and global consistency of row-convex constraint networks, Journal of the ACM, vol.42, issue.3, pp.543-561, 1995.

T. Walsh, The IJCAI-97 Workshop on Computer Games, ICGA Journal, vol.20, issue.1, pp.54-55, 1997.

T. Walsh, Stochastic constraint programming, Proceedings ECAI'02, pp.111-115, 2002.

D. Waltz, Generating semantic descriptions from drawings of scenes with shadows, 1972.

M. Yokoo, E. H. Durfee, T. Ishida, and K. Kuwabara, The distributed constraint satisfaction problem: formalization and algorithms, IEEE Transactions on Knowledge and Data Engineering, vol.10, issue.5, pp.673-685, 1998.

D. Zhuk, A Proof of CSP Dichotomy Conjecture, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), pp.331-342, 2017.