K. Apt, The essence of constraint propagation. Theoretical computer science, vol.221, pp.179-210, 1999.

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

R. Chellappa and A. Jain, Markov Random Fields: Theory and Applications, 1993.

C. W. Choi, W. Harvey, J. H. Lee, and P. J. Stuckey, Finite domain bounds consistency revisited, Proc. of Australian Conference on Artificial Intelligence, pp.49-58, 2006.

M. Cooper and T. Schiex, Arc consistency for soft constraints, Artificial Intelligence, vol.154, pp.199-227, 2004.

M. C. Cooper, S. De-givry, M. Sànchez, T. Schiex, and M. Zytnicki, Virtual arc consistency for weighted CSP, Proc. of AAAI, 2008.
URL : https://hal.archives-ouvertes.fr/hal-02752851

M. C. Cooper, S. De-givry, and T. Schiex, Optimal soft arc consistency, Proc. of IJCAI'07, pp.68-73, 2007.
URL : https://hal.archives-ouvertes.fr/hal-02754114

S. De-givry and L. Jeannin, A unified framework for partial and hybrid search methods in constraint programming, Computer & Operations Research, vol.33, issue.10, pp.2805-2833, 2006.
URL : https://hal.archives-ouvertes.fr/hal-02659665

S. De-givry, L. Jeannin, F. Josset, J. Mattioli, N. Museux et al., The THALES constraint programming framework for hard and soft real-time applications. The PLANET Newsletter, vol.5, pp.5-7, 2002.

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

D. Gautheret, F. Major, and R. Cedergren, Pattern searching/alignment with RNA primary and secondary structures: an effective descriptor for tRNA, Comp. Appl. Biosc, vol.6, pp.325-331, 1990.

F. Heras, J. Larrosa, S. De-givry, and M. Zytnicki, Existential arc consistency: Getting closer to full arc consistency in weighted CSPs, Proc. of IJCAI'05, pp.84-89, 2005.
URL : https://hal.archives-ouvertes.fr/hal-02762983

L. Khatib, P. Morris, R. Morris, and F. Rossi, Temporal constraint reasoning with preferences, Proc. of IJCAI'01, pp.322-327, 2001.

J. Larrosa, Node and arc consistency in weighted CSP, Proc. of AAAI'02, pp.48-53, 2002.

J. Larrosa and T. Schiex, Solving weighted CSP by maintaining arc-consistency, Artificial Intelligence, vol.159, issue.1-2, pp.1-26, 2004.

J. Lee and K. Leung, Towards Efficient Consistency Enforcement for Global Constraints in Weighted Constraint Satisfaction, Proc. of IJCAI'09, 2009.

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

P. Meseguer, F. Rossi, and T. Schiex, Handbook of constraint programming, Foundations of Artificial Intelligence, issue.9, pp.281-328, 2006.

T. Petit, J. Régin, and C. Bessière, Meta-constraints on violations for over constrained problems, Proc. of ICTAI'00, pp.358-365, 2000.

T. Petit, J. C. Régin, and C. Bessière, Range-based algorithm for Max-CSP, Proc. of CP'02, pp.280-294, 2002.
URL : https://hal.archives-ouvertes.fr/lirmm-00269318

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

M. Sànchez, S. De-givry, and T. Schiex, Mendelian error detection in complex pedigrees using weighted constraint satisfaction techniques, Constraints, vol.13, issue.1-2, pp.130-154, 2008.

T. Sandholm, An Algorithm for Optimal Winner Determination in Combinatorial Auctions, Proc. of IJCAI'99, pp.542-547, 1999.

T. Schiex, Arc consistency for soft constraints, Proc. of CP'00, pp.411-424, 2000.

A. Tarski, A lattice-theoretical fixpoint theorem and its applications, Pacific Journal of Mathematics, vol.5, issue.2, pp.285-309, 1955.

P. Thébault, S. De-givry, T. Schiex, and C. Gaspin, Searching RNA motifs and their intermolecular contacts with constraint networks, Bioinformatics, vol.22, issue.17, pp.2074-80, 2006.

P. Van-hentenryck, Y. Deville, and C. Teng, A generic arc-consistency algorithm and its specializations, Artificial Intelligence, vol.57, issue.2-3, pp.291-321, 1992.

W. Van-hoeve, G. Pesant, and L. Rousseau, On global warming: Flow-based soft global constraints, Journal of Heuristics, vol.12, issue.4, pp.347-373, 2006.

G. Verfaillie and M. Lemaître, Selecting and scheduling observations for agile satellites: some lessons from the constraint reasoning community point of view, Proc. of CP'01, pp.670-684, 2001.

S. Vialette, On the computational complexity of 2-interval pattern matching problems, Theoretical Computer Science, vol.312, issue.2-3, pp.223-249, 2004.

M. Zytnicki, C. Gaspin, and T. Schiex, DARN! A soft constraint solver for RNA motif localization, Constraints, vol.13, issue.1-2, pp.91-109, 2008.