. Bistarelli, Lab eling and partial local consistency for soft constrain t programming, Pruning for the minim um constrain t family and for the number of distinct values constrain t family. Pr oceedings CP, vol.58, pp.21-70, 1992.

;. M. Johnson, D. S. Garey, and . Johnson, Computers and intractabilit y : A guide to the theory of NP-completeness, 1979.

-. De-siqueira, N. Et-puget-;-j-l.-de-siqueira, N. , and J. Puget, Explanationbased generalization of failures, Ulrich Junk er. QuickXplain : Conflict detection for arbitrary constrain t propagation algorithms. IJCAI'01 workshop on modelling and solving problems with constr aints, pp.21-45, 1988.

, Main taining reversible DAC for Max-CSP, Artificial Intel ligence, vol.107, pp.149-163, 1999.

. Larrosa, Ja vier Larrosa. Node and arc consistency in weighted CSP, Pr oceedings AAAI, pp.48-53, 2002.

E. Lawler-;-matroids, . Holt, W. ;. Rinehart, and . Lema??tre, Integrating algorithms for Weighted CSP in a constrain t programming framew ork. CP'2001 workshop on soft constr aints, SOFT'O1, New lower bounds of constrain t violations for over constrained prolems. Pr oceedings CP, vol.10, pp.332-345, 1959.

;. T. Schiex and . Schiex, Arc consistency for soft constrain ts, Pr oceedings CP, pp.411-424, 2000.

. Verfaillie, Russian doll searc h for solving constrain t optimisation problems, Une comparaison des cohérences d'arc dans les Max-CSP. Pr oceedings JNPC, pp.181-187, 1996.

;. R. Wallace and . Wallace, Directed arc consistency prepro cessing as a strategy for maximal constrain t satisfaction, Pr oceedings ECAI, pp.69-77, 1994.