Most of the current algorithms dedicated to the resolution of over-constrained problems, as PFC-MRDAC, are based on the search for a support for each value of each variable taken independently. The structure of soft constraints is only used to speed-up such a search, but not to globally deduce the existence or the absence of support. These algorithms do not use the filtering algorithms associated with the soft constraints.

In this paper we present a new schema where a soft constraint is represented by a hard constraint in order to automatically benefit from the pruning performance of the filtering algorithm associated with this constraint and from the incremental aspect of these filtering algorithms. In other words, thanks to this schema every filtering algorithm associated with a constraint can still be used when the constraint is soft. The PFC-MRDAC (via the Satisfiability Sum constraint) algorithm and the search for disjoint conflict sets are then adapted to this new schema.


Constraint Satisfaction Problem Soft Constraint Hard Constraint Choice Point Constraint Network 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bistarelli, S., Montanari, U., Rossi, F., Schiex, T., Verfaillie, G., Fargier, H.: Semiring-based csps and valued csps: Frameworks, properties, and comparison. Constraints 4, 199–240 (1999)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Larrosa, J., Meseguer, P., Schiex, T.: Maintaining reversible DAC for Max-CSP. Artificial Intelligence 107, 149–163 (1999)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Petit, T., Régin, J.-C., Bessière, C.: Specific filtering algorithms for over-constrained problems. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 451–465. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  4. 4.
    Petit, T., Régin, J.-C., Bessière, C.: Meta constraints on violations for over-constrained problems. In: Proceedings ICTAI 2000, pp. 358–365 (2000)Google Scholar
  5. 5.
    Régin, J.-C., Petit, T., Bessière, C., Puget, J.-F.: New lower bounds of constraint violations for over-constrained problems. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 332–345. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  6. 6.
    van Hentenryck, P., Saraswat, V., Deville, Y.: Design, implementation, and evaluation of the constraint language cc(fd). Journal of Logic Programming 37(1-3), 139–164 (1998)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Jean-Charles Régin
    • 1
  1. 1.I3S - CNRSUniversité de Nice - Sophia AntipolisSophia Antipolis CedexFrance

Personalised recommendations