O. Akgun, A. M. Frisch, B. Hnich, C. Jefferson, and I. Miguel, Conjure revisited : Towards automated constraint modelling, 1109.

J. Amilhastre, Representation par automate d'ensembles de solutions de problemes de satisfaction de contraintes, 1999.

P. Baptiste, C. L. Pape, and W. Nuijten, Satisfiability tests and time-bound adjustments for cumulative scheduling problems, Annals of Operations Research, vol.92, pp.305-333, 1999.
DOI : 10.1023/A:1018995000688

P. Baptiste, C. L. Pape, and W. Nuijten, Constraint-Based Scheduling : Applying Constraint Programming to Scheduling Problems, International Series in Operations Research and Management Science. Kluwer, 2001.
DOI : 10.1007/978-1-4615-1479-4
URL : https://hal.archives-ouvertes.fr/inria-00123562

P. Baptiste, C. L. Pape, and L. Peridy, Global Constraints for Partial CSPs: A Case-Study of Resource and Due Date Constraints, Proc. CP, pp.87-102, 1998.
DOI : 10.1007/3-540-49481-2_8

N. Beldiceanu, Global Constraints as Graph Properties on a Structured Network of Elementary Constraints of the Same Type, Proc. CP, pp.52-66, 2000.
DOI : 10.1007/3-540-45349-0_6

N. Beldiceanu and M. Carlsson, Sweep as a generic pruning technique applied to constraint relaxation, Proc. of the CP workshop SOFT'01 : Modeling and Solving Problems with Soft Constraints, pp.43-55, 2001.

N. Beldiceanu and M. Carlsson, A New Multi-resource cumulatives Constraint with Negative Heights, Proc. CP, pp.63-79, 2002.
DOI : 10.1007/3-540-46135-3_5
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.24.5871

N. Beldiceanu, M. Carlsson, R. Debruyne, and T. Petit, Reformulation of Global Constraints Based on Constraints Checkers, Constraints, vol.11, issue.2, pp.339-362, 2005.
DOI : 10.1007/s10601-005-2809-x

N. Beldiceanu, M. Carlsson, S. Demassey, and T. Petit, Graph Properties Based Filtering, CP, pp.59-74, 2006.
DOI : 10.1007/11889205_7
URL : https://hal.archives-ouvertes.fr/hal-00481579

N. Beldiceanu, M. Carlsson, S. Demassey, and T. Petit, Global Constraint Catalogue: Past, Present and Future, Constraints, vol.2, issue.1, pp.21-62, 2007.
DOI : 10.1007/s10601-006-9010-8
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.102.251

N. Beldiceanu, M. Carlsson, P. Flener, and J. Pearson, On matrices, automata, and double counting in constraint programming, Constraints, vol.196, issue.2, pp.108-140, 2013.
DOI : 10.1007/s10601-012-9134-y
URL : https://hal.archives-ouvertes.fr/hal-00758531

N. Beldiceanu, M. Carlsson, J. Rampon, and C. Truchet, Graph Invariants as Necessary Conditions for Global Constraints, CP, pp.92-106, 2005.
DOI : 10.1007/11564751_10

N. Beldiceanu, M. Carlsson, and J. Rampon, Global constraint catalog, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00485396

N. Beldiceanu, M. Carlsson, and J. Rampon, Global Constraint Catalog, SICS, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00485396

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

N. Beldiceanu, M. Carlsson, T. Petit, and J. Régin, An o(nlog n) bound consistency algorithm for the conjunction of an alldifferent and an inequality between a sum of variables and a constant, and its generalization, ECAI, pp.145-150, 2012.

N. Beldiceanu and E. Contejean, Introducing global constraints in CHIP, Mathematical and Computer Modelling, vol.20, issue.12, pp.97-123, 1994.
DOI : 10.1016/0895-7177(94)90127-9
URL : https://hal.archives-ouvertes.fr/hal-00442810

N. Beldiceanu, F. Hermenier, X. Lorca, and T. Petit, The Increasing Nvalue??Constraint, CPAIOR, pp.25-39, 2010.
DOI : 10.1007/978-3-642-13520-0_5
URL : https://hal.archives-ouvertes.fr/hal-00915800

N. Beldiceanu and T. Petit, Cost Evaluation of Soft Global Constraints, CPAIOR, pp.80-95, 2004.
DOI : 10.1007/978-3-540-24664-0_6

N. Beldiceanu, T. Petit, and G. Rochart, Bounds of Graph Characteristics, CP, pp.742-746, 2005.
DOI : 10.1007/11564751_56

N. Beldiceanu, T. Petit, and G. Rochart, Bounds of graph parameters for global constraints, RAIRO - Operations Research, vol.40, issue.4, pp.327-353, 2006.
DOI : 10.1051/ro:2007001

C. Berge, Graphs and hypergraphs, 1970.

C. Bessiere, Constraint propagation of the Handbook of Constraint Programming, LIRMM, 2006.

C. Bessiere, R. Coletta, and T. Petit, Acquiring Parameters of Implied Global Constraints
DOI : 10.1007/11564751_57
URL : https://hal.archives-ouvertes.fr/lirmm-00106045

C. Bessì-ere, R. Coletta, and T. Petit, Learning implied global constraints, Proc. IJCAI, pp.44-49, 2007.

C. Bessiere, E. Hebrard, B. Hnich, Z. Kiziltan, C. Quimper et al., Reformulating global constraints : The slideand regularconstraints, SARA, pp.80-92, 2007.
DOI : 10.1007/978-3-540-73580-9_9
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.81.8197

C. Bessiere, E. Hebrard, B. Hnich, Z. Kiziltan, and T. Walsh, Slide : A useful special case of the cardpath constraint, ECAI, pp.475-479, 2008.
URL : https://hal.archives-ouvertes.fr/lirmm-00329876

C. Bessiere, E. Hebrard, G. Katsirelos, Z. Kiziltan, ´. E. Picard-cantin et al., The Balance Constraint Family, CP, pp.174-189, 2014.
DOI : 10.1007/978-3-319-10428-7_15
URL : https://hal.archives-ouvertes.fr/lirmm-01067459

C. Bessiere, K. Stergiou, and T. Walsh, Domain filtering consistencies for non-binary constraints, Artificial Intelligence, vol.172, issue.6-7, pp.800-822, 2008.
DOI : 10.1016/j.artint.2007.10.016
URL : https://hal.archives-ouvertes.fr/lirmm-00250086

C. Bessì-ere, T. Petit, and B. Zanuttini, Making bound consistency as effective as arc consistency, IJCAI, pp.425-430, 2009.

C. Bessì-ere and P. Van-hentenryck, To be or not to be... a global constraint, Proc. CP, pp.789-794, 2003.

S. Bistarelli, U. Montanari, F. Rossi, T. Schiex, G. Verfaillie et al., Semiring-based CSPs and valued CSPs : Frameworks, properties, and comparison, Constraints, vol.4, issue.3, pp.199-240, 1999.
DOI : 10.1023/A:1026441215081

L. Bordeaux and E. Monfroy, Beyond NP: Arc-Consistency for Quantified Constraints, CP, pp.371-386, 2002.
DOI : 10.1007/3-540-46135-3_25
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.18.3314

S. Brockbank, G. Pesant, and L. Rousseau, Counting Spanning Trees to Guide Search in Constrained Spanning Tree Problems, CP, pp.175-183, 2013.
DOI : 10.1007/978-3-642-40627-0_16

H. Cambazard, E. Hebrard, B. O. Sullivan, and A. Papadopoulos, Local search and constraint programming for the post enrolment-based course timetabling problem, Annals of Operations Research, vol.13, issue.2, pp.111-135, 2012.
DOI : 10.1007/s10479-010-0737-7
URL : https://hal.archives-ouvertes.fr/hal-00790854

A. De-clercq, T. Petit, N. Beldiceanu, and N. Jussien, Filtering Algorithms for Discrete Cumulative Problems with Overloads of Resource, Proc. CP, pp.240-255, 2011.
DOI : 10.1007/978-3-642-23786-7_20
URL : https://hal.archives-ouvertes.fr/hal-00753375

S. Colton and I. Miguel, Constraint Generation via Automated Theory Formation, Proc. CP, pp.575-579, 2001.
DOI : 10.1007/3-540-45578-7_42
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.3.4145

T. Dao, K. Duong, and C. Vrain, A Declarative Framework for Constrained Clustering, ECML/PKDD (3), pp.419-434, 2013.
DOI : 10.1007/978-3-642-40994-3_27
URL : https://hal.archives-ouvertes.fr/hal-00840374

A. Davenport, C. Jefflot, and J. Beck, Slack-based techniques for robust schedules, European Conference on Planning, pp.7-18, 2001.

R. Debruyne and C. Bessì-ere, Domain filtering consistencies, Journal of Artificial Intelligence Research, vol.14, pp.205-230, 2001.

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

S. Demassey, G. Pesant, and L. Rousseau, A Cost-Regular Based Hybrid Column Generation Approach, Constraints, vol.12, issue.4???5, pp.315-333, 2006.
DOI : 10.1007/s10601-006-9003-7
URL : https://hal.archives-ouvertes.fr/hal-00293562

A. Derrien and T. Petit, The energetic reasoning checker revisited. CoRR, abs, 1310.
URL : https://hal.archives-ouvertes.fr/hal-00873940

A. Derrien and T. Petit, A New Characterization of Relevant Intervals for Energetic Reasoning, Proccedings of the 20th International Conference CP 2014, 2014.
DOI : 10.1007/978-3-319-10428-7_22
URL : https://hal.archives-ouvertes.fr/hal-01084436

A. Derrien, T. Petit, and S. Zampelli, A Declarative Paradigm for Robust Cumulative Scheduling, the Proccedings of the 20th International Conference CP 2014, 2014.
DOI : 10.1007/978-3-319-10428-7_23
URL : https://hal.archives-ouvertes.fr/hal-01084256

D. Dubois, H. Fargier, and H. Prade, The calculus of fuzzy restrictions as a basis for flexible constraint satisfaction, [Proceedings 1993] Second IEEE International Conference on Fuzzy Systems, 1993.
DOI : 10.1109/FUZZY.1993.327356

J. Fages, X. Lorca, and T. Petit, Self-decomposable global constraints, Proccedings of ECAI 2014 International Conference, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01088964

H. Fargier, J. Lang, and T. Schiex, Selecting preferred solutions in fuzzy constraint satisfaction problems. First European Congress on Fuzzy and Intelligent Technologies, 1993.

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

E. C. Freuder, Partial constraint satisfaction, Proc. IJCAI, pp.278-283, 1989.

E. C. Freuder and R. J. Wallace, Partial constraint satisfaction, Artificial Intelligence, vol.58, issue.1-3, pp.21-70, 1992.
DOI : 10.1016/0004-3702(92)90004-H

A. M. Frisch, C. Jefferson, B. M. Hernandez, and I. Miguel, The rules of constraint modelling, Proc. IJCAI, pp.109-116, 2005.

M. R. Garey and D. S. Johnson, Computers and intractability : A guide to the theory of NP-completeness, W.H. Freeman and Company, 1979.

L. Di, G. , and A. Schaerf, Easylocal++ : an object-oriented framework for the flexible design of local-search algorithms, Softw., Pract. Exper, vol.33, issue.8, pp.733-765, 2003.

D. Hanák, Implementing global constraints as structured graphs of elementary constraints, Scientific Journal Acta Cybernetica, 2003.

E. Hebrard, Robust solutions for constraint satisfaction and optimization, AAAI, pp.952-953, 2004.

E. Hebrard, B. Hnich, and T. Walsh, Super Solutions in Constraint Programming, CPAIOR, pp.157-172, 2004.
DOI : 10.1007/978-3-540-24664-0_11

E. Hebrard, B. O. Sullivan, and I. Razgon, A Soft Constraint of Equality: Complexity and Approximability, CP, pp.358-371, 2008.
DOI : 10.1007/978-3-540-85958-1_24

L. Hellsten, Consistency propagation for stretch constraints, 2004.

P. Van-hentenryck, Y. Deville, and C. M. Teng, A generic arc-consistency algorithm and its specializations, Artificial Intelligence, vol.57, issue.2-3, pp.291-321, 1992.
DOI : 10.1016/0004-3702(92)90020-X

F. Hermenier, X. Lorca, J. Menaud, G. Muller, and J. L. , Entropy, Proceedings of the 2009 ACM SIGPLAN/SIGOPS international conference on Virtual execution environments, VEE '09, pp.41-50, 2009.
DOI : 10.1145/1508293.1508300
URL : https://hal.archives-ouvertes.fr/inria-00320204

W. Van-hoeve, G. Pesant, and L. Rousseau, On global warming: Flow-based soft global constraints, Journal of Heuristics, vol.1, issue.4, pp.4-5475, 2006.
DOI : 10.1007/s10732-006-6550-4

J. De-siqueira, N. , and J. Puget, Explanation-based generalization of failures, Proc. ECAI, pp.339-344, 1988.

P. Janssen and M. Vilarem, Probì emes de satisfaction de contraintes : techniques de résolution et applicationàapplicationà la synthèse de peptides, Research Report C.R.I.M, vol.54, 1988.

P. Jégou, ContributionàContributionà l'´ etude desprobì emes de satisfaction de contraintes : algorithmes de propagation et de résolution

N. Jussien, Relaxation de contraintes pour lesprobì emes dynamiques, 1997.

N. Jussien, The versatility of using explanations within constraint programming. Habilitation thesis of, 2003.
URL : https://hal.archives-ouvertes.fr/tel-00293905

N. Jussien and P. Boizumault, Best-first search for property maintenance in reactive constraint systems, In ILPS, pp.339-353, 1997.

S. Kadioglu and M. Sellmann, Efficient context-free grammar constraints, AAAI, pp.310-316, 2008.

R. Kameugne, L. P. Fotso, J. Scott, and Y. Ngo-kateu, A quadratic edge-finding filtering algorithm for cumulative resource constraints, CP, pp.478-492, 2011.

G. Katsirelos, N. Narodytska, and T. Walsh, The weighted cfgconstraint, CPAIOR, pp.323-327, 2008.

G. Katsirelos, N. Narodytska, and T. Walsh, The SeqBin Constraint Revisited, CP, pp.332-347, 2012.
DOI : 10.1007/978-3-642-33558-7_26

A. Lahrichi, The notions of Hump, Compulsory Part and their use in Cumulative Problems

A. Lallouet and A. Legtchenko, Partially defined constraints in constraint-based design, AI EDAM, vol.none, issue.04, pp.297-311, 2006.
DOI : 10.1016/0893-6080(89)90020-8
URL : https://hal.archives-ouvertes.fr/hal-00085477

F. Lardeux, E. Monfroy, and F. Saubion, Interleaved Alldifferent Constraints: CSP vs. SAT Approaches, Proc. AIMSA, pp.380-384, 2008.
DOI : 10.1007/978-3-540-85776-1_34
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.139.3079

J. Larrosa, P. Meseguer, and T. Schiex, Maintaining reversible DAC for Max-CSP, Artificial Intelligence, vol.107, issue.1, pp.149-163, 1999.
DOI : 10.1016/S0004-3702(98)00108-8

J. Larrosa and T. Schiex, Solving weighted CSP by maintaining arc consistency, Artificial Intelligence, vol.159, issue.1-2, pp.1-26, 2004.
DOI : 10.1016/j.artint.2004.05.004

J. Laurì-ere, Un langage et un programme pourénoncerpourénoncer et résoudre desprobì emes combinatoires, 1976.

N. Lazaar, A. Gotlieb, and Y. Lebbah, On Testing Constraint Programs, CP, pp.330-344, 2010.
DOI : 10.1007/978-3-642-15396-9_28
URL : https://hal.archives-ouvertes.fr/hal-00699237

J. H. Lee and K. L. Leung, Towards efficient consistency enforcement for global constraints in weighted constraint satisfaction, IJCAI, pp.559-565, 2009.

M. Lemaitre, G. Verfaillie, E. Bourreau, and F. Laburthe, Integrating algorithms for weigthed csp in a constraint programming framework, CP Worshop on Modelling and Solving Problems with Soft Constraints, 2001.

K. Leo, C. Mears, G. Tack, M. Garcia-de, and L. Banda, Globalizing Constraint Models, CP, pp.432-447, 2013.
DOI : 10.1007/978-3-642-40627-0_34

D. Lesaint, D. Mehta, B. O-'sullivan, L. Quesada, and N. Wilson, A soft global precedence constraint, IJCAI, pp.566-571, 2009.

A. Letort, Passagè a l'´ echelle pour les contraintes d'ordonnancement multi-ressources, 2013.

A. Letort, N. Beldiceanu, and M. Carlsson, A Scalable Sweep Algorithm for the cumulative Constraint, CP, pp.439-454, 2012.
DOI : 10.1007/978-3-642-33558-7_33
URL : https://hal.archives-ouvertes.fr/hal-00754043

R. Leus, C. Artigues, and F. Talla-nobibon, Robust optimization for resource-constrained project scheduling with uncertain activity durations, 2011 IEEE International Conference on Industrial Engineering and Engineering Management, pp.101-105, 2011.
DOI : 10.1109/IEEM.2011.6117887
URL : https://hal.archives-ouvertes.fr/hal-00564435

P. Lopez, J. Erschler, and P. Esquirol, Ordonnancement de tâches sous contraintes : une approché energétique, pp.5-6453, 1992.

A. López-ortiz, C. Quimper, J. Tromp, and P. Van-beek, A fast and simple algorithm for bounds consistency of the alldifferent constraint, IJCAI, pp.245-250, 2003.

M. J. Maher, Contractibility and contractible approximations of soft global constraints, ICLP (Technical Communications), pp.114-123, 2010.

L. Mercier and P. Van-hentenryck, Strong polynomiality of resource constraint propagation, Discrete Optimization, vol.4, issue.3-4, pp.288-314, 2007.
DOI : 10.1016/j.disopt.2007.01.001

L. Mercier and P. Van-hentenryck, Edge Finding for Cumulative Scheduling, INFORMS Journal on Computing, vol.20, issue.1, pp.143-153, 2008.
DOI : 10.1287/ijoc.1070.0226

P. Meseguer, J. Larrosa, and M. Sanchez, Lower Bounds for Non-binary Constraint Optimization Problems, Proc. CP, pp.317-331, 2001.
DOI : 10.1007/3-540-45578-7_22

J. Métivier, P. Boizumault, and S. Loudni, Σ-All Different: Softening AllDifferent in Weighted CSPs, 19th IEEE International Conference on Tools with Artificial Intelligence(ICTAI 2007), pp.223-230, 2007.
DOI : 10.1109/ICTAI.2007.82

J. Monette, N. Beldiceanu, P. Flener, and J. Pearson, A Parametric Propagator for Discretely Convex Pairs of Sum Constraints, CP, pp.529-544, 2013.
DOI : 10.1007/978-3-642-40627-0_40
URL : https://hal.archives-ouvertes.fr/hal-00874309

U. Montanari, Networks of constraints: Fundamental properties and applications to picture processing, Information Sciences, vol.7, pp.95-132, 1974.
DOI : 10.1016/0020-0255(74)90008-5

N. Narodytska, T. Petit, M. Siala, and T. Walsh, Three generalizations of the FOCUS constraint, IJCAI, 2013.
DOI : 10.1007/s10601-015-9233-7
URL : https://hal.archives-ouvertes.fr/hal-00820894

N. Narodytska and T. Walsh, Breaking Symmetry with Different Orderings, CP, pp.545-561, 2013.
DOI : 10.1007/978-3-642-40627-0_41

W. Nuijten, Time and resource constrained scheduling : a Constraint Satisfaction Approach. Doctoral dissertation, 1994.

F. Pachet and P. Roy, Automatic Generation of Music Programs, Proc. CP, pp.331-345, 1999.
DOI : 10.1007/978-3-540-48085-3_24

L. Perron, P. Shaw, and V. Furnon, Propagation Guided Large Neighborhood Search, CP, pp.468-481, 2004.
DOI : 10.1007/978-3-540-30201-8_35

G. Pesant, A Filtering Algorithm for the Stretch Constraint, Proc. CP, pp.181-195, 2001.
DOI : 10.1007/3-540-45578-7_13

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

G. Pesant and J. Régin, SPREAD: A Balancing Constraint Based on Statistics, Proc. CP, pp.460-474, 2005.
DOI : 10.1007/11564751_35

T. Petit, Modélisation et algorithmes de résolution desprobì emes sur-contraints. Doctoral dissertation, 2002.

T. Petit, Focus : A Constraint for Concentrating High Costs, CP, pp.577-592, 2012.
DOI : 10.1007/978-3-642-33558-7_42
URL : https://hal.archives-ouvertes.fr/hal-00753598

T. Petit, Intermediary local consistencies, ECAI, pp.919-920, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00753664

T. Petit, N. Beldiceanu, and X. Lorca, A generalized arc-consistency algorithm for a class of counting constraints, IJCAI, pp.643-648, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00754017

T. Petit, N. Beldiceanu, and X. Lorca, A generalized arc-consistency algorithm for a class of counting constraints : Revised edition that incorporates one correction, 1110.
URL : https://hal.archives-ouvertes.fr/hal-00754032

T. Petit and E. Poder, Global Propagation of Practicability Constraints, Proc. CPAIOR, pp.361-366, 2008.
DOI : 10.1007/978-3-540-68155-7_38
URL : https://hal.archives-ouvertes.fr/hal-00482034

T. Petit and E. Poder, Global propagation of side constraints for solving over-constrained problems. Annals of 0perations Research, pp.295-314, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00482014

T. Petit and J. Régin, The ordered distribute constraint, ICTAI, pp.431-438, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00753742

T. Petit and J. Régin, THE ORDERED DISTRIBUTE CONSTRAINT, International Journal on Artificial Intelligence Tools, vol.20, issue.04, pp.617-637, 2011.
DOI : 10.1142/S0218213011000371
URL : https://hal.archives-ouvertes.fr/hal-00753742

T. Petit, J. Régin, and N. Beldiceanu, A ??(n) Bound-Consistency Algorithm for the Increasing Sum Constraint, CP, pp.721-728, 2011.
DOI : 10.1007/978-3-642-23786-7_54
URL : https://hal.archives-ouvertes.fr/hal-00753385

T. Petit, J. Régin, and C. Bessì-ere, Meta-constraints on violations for over constrained problems, Proceedings 12th IEEE Internationals Conference on Tools with Artificial Intelligence. ICTAI 2000, pp.358-365, 2000.
DOI : 10.1109/TAI.2000.889894

T. Petit, J. Régin, and C. Bessì-ere, Specific Filtering Algorithms for Over-Constrained Problems, Proc. CP, pp.451-463, 2001.
DOI : 10.1007/3-540-45578-7_31

T. Petit, J. Régin, and C. Bessì-ere, Range-based algorithm for Max-CSP. ECAI workshop on Modelling and Solving Problems with Constraints, 2002.
URL : https://hal.archives-ouvertes.fr/lirmm-00269318

J. Puget, Symmetry breaking revisited, CP, pp.446-461, 2002.
DOI : 10.1007/s10601-004-5306-8
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.108.7112

J. Puget, Symmetry Breaking Using Stabilizers, CP, pp.585-599, 2003.
DOI : 10.1007/978-3-540-45193-8_40

J. Puget, Automatic Detection of Variable and Value Symmetries, Proc. CP, pp.475-489, 2005.
DOI : 10.1007/11564751_36

J. F. Puget, Constraint Programming Next Challenge: Simplicity of Use, Proc. CP, pp.5-8, 2004.
DOI : 10.1007/978-3-540-30201-8_2

C. Quimper and T. W. , Decomposing Global Grammar Constraints, CP, pp.590-604, 2007.
DOI : 10.1007/978-3-540-74970-7_42

C. Quimper and T. W. , Decompositions of grammar constraints, AAAI, pp.1567-1570, 2008.

C. Quimper and T. Walsh, Global Grammar Constraints, CP, pp.751-755, 2006.
DOI : 10.1007/11889205_64
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.124.937

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

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

J. Régin, Minimization of the number of breaks in sports scheduling problems using constraints programming, DIMACS series in Discrete Mathematics and Theoretical Computer Science, vol.57, pp.115-130, 2001.

J. Régin, J. Puget, and T. Petit, Representation of soft constraints by hard constraints, Proc. JFPLC'02, 2002.

J. Régin and T. Petit, The Objective Sum Constraint, CPAIOR, pp.190-195, 2011.
DOI : 10.1007/978-3-642-21311-3_18

J. Régin, T. Petit, C. Bessì, and J. Puget, An original constraint based approach for solving over constrained prolems, Proc. CP, pp.543-548, 2000.

J. Régin, T. Petit, C. Bessì, and J. Puget, New lower bounds of constraint violations for over constrained prolems, Proc. CP, pp.332-345, 2001.

P. Schaus, Y. Deville, P. Dupont, and J. Régin, The Deviation Constraint, Proc. CPAIOR, pp.260-274, 2007.
DOI : 10.1007/978-3-540-72397-4_19

P. Schaus, P. Van-hentenryck, and J. Régin, Scalable Load Balancing in Nurse to Patient Assignment Problems, Proc. CPAIOR, pp.248-262, 2009.
DOI : 10.1007/978-3-642-01929-6_19

T. Schiex, Possibilistic Constraint Satisfaction Problems or ???How to handle soft constraints????, Proc. of 8th Conf. of Uncertainty in AI, 1992.
DOI : 10.1016/B978-1-4832-8287-9.50041-4

C. Schulte and G. Tack, Perfect Derived Propagators, CP, pp.571-575, 2008.
DOI : 10.1007/978-3-540-85958-1_44
URL : http://arxiv.org/abs/0806.1806

B. Smith, T. Stergiou, and . Walsh, Modelling the golomb ruler problem, Proc. IJCAI'99 workshop on non-binary constraints, 1999.

B. M. Smith, B. O. Bistarelli, and . Sullivan, Constraint Symmetry for the Soft CSP, CP, pp.872-879, 2007.
DOI : 10.1007/978-3-540-74970-7_66

G. Tack, C. Schulte, and G. Smolka, Generating Propagators for Finite Set Constraints, CP, pp.575-589, 2006.
DOI : 10.1007/11889205_41

G. Tack, Constraint Propagation ? Models, Techniques, Implementation. Doctoral dissertation, 2009.

P. Torres and P. Lopez, On Not-First/Not-Last conditions in disjunctive scheduling, European Journal of Operational Research, vol.127, issue.2, pp.332-343, 2000.
DOI : 10.1016/S0377-2217(99)00497-X
URL : https://hal.archives-ouvertes.fr/hal-00022745

P. Van-hentenryck and L. Michel, Control abstractions for local search, Proc. CP, pp.66-80, 2003.

W. J. Van-hoeve, A Hyper-arc Consistency Algorithm for the Soft Alldifferent Constraint, CP, pp.679-689, 2004.
DOI : 10.1007/978-3-540-30201-8_49

N. R. Vempaty, Solving constraint satisfaction problems using finite state automata, National Conference on Artificial Intelligence (AAAI-92), pp.453-458, 1992.

P. Vilím, Max Energy Filtering Algorithm for Discrete Cumulative Resources, Proc. CPAIOR, pp.294-308, 2009.
DOI : 10.1007/978-3-642-01929-6_22

P. Vilím, Timetable Edge Finding Filtering Algorithm for Discrete Cumulative Resources, CPAIOR, pp.230-245, 2011.
DOI : 10.1007/978-3-642-21311-3_22

J. Vion, T. Petit, and N. Jussien, Integrating Strong Local Consistencies into Constraint Solvers, CSCLP, pp.90-104, 2009.
DOI : 10.1007/978-3-642-19486-3_6
URL : https://hal.archives-ouvertes.fr/hal-00869092

W. Wu, K. N. Brown, and J. C. Beck, Scheduling with uncertain durations: Modeling -robust scheduling with constraints, Computers & Operations Research, vol.36, issue.8, pp.2348-2356, 2009.
DOI : 10.1016/j.cor.2008.08.008

S. Zampelli, Y. Vergados, R. Van-schaeren, W. Dullaert, and B. Raa, The Berth Allocation and Quay Crane Assignment Problem Using a CP Approach, CP, pp.880-896, 2013.
DOI : 10.1007/978-3-642-40627-0_64

A. Zanarini, M. Milano, and G. Pesant, Improved Algorithm for the Soft Global Cardinality Constraint, CPAIOR, pp.288-299, 2006.
DOI : 10.1007/11757375_23

A. Zanarini and G. Pesant, Solution counting algorithms for constraint-centered search heuristics, Constraints, vol.8, issue.2, pp.392-413, 2009.
DOI : 10.1007/s10601-008-9065-9
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.146.1487

Y. Zhang and R. H. Yap, Arc consistency on n-ary monotonic and linear constraints

M. Zytnicki, C. Gaspin, S. De-givry, and T. Schiex, Bounds arc consistency for weighted csps, J. Artif. Intell. Res. (JAIR), vol.35, pp.593-621, 2009.