New Lower Bounds of Constraint Violations for Over-Constrained Problems

  • Jean-Charles Régin
  • Thierry Petit
  • Christian Bessière
  • Jean-François Puget
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2239)


In recent years, many works have been carried out to solve over-constrained problems, and more specifically the Maximal Constraint Satisfaction Problem (Max-CSP), where the goal is to minimize the number of constraint violations. Some lower bounds on this number of violations have been proposed in the literature.

In this paper, we characterize the constraints that are ignored by the existing results, we propose new lower bounds which takes into account some of these ignored constraints and we show how these new bounds can be integrated into existing ones in order to improve the previous results.

Our work also generalize the previous studies by dealing with any kind of constraints, as non binary constraints, or constraints with specific filtering algorithms. Furthermore, in order to integrate these algorithms into any constraint solver, we suggest to represent a Max-CSP as a single global constraint. This constraint can be itself included into any set of constraint. In this way, an over-constrained part of a problem can be isolated from constraints that must be necessarily satisfied.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    S. Bistarelli, U. Montanari, F. Rossi, T. Schiex, G. Verfaillie, and H. Fargier. Semiring-based csps and valued csps: Frameworks, properties, and comparison. Constraints, 4:199–240, 1999.zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    E. Freuder and R. Wallace. Partial constraint satisfaction. Artificial Intelligence, 58:21–70, 1992.CrossRefMathSciNetGoogle Scholar
  3. 3.
    J.L. de Siqueira N. and J. Puget. Explanation-based generalization of failures. Proceedings ECAI, pages 339–344, 1988.Google Scholar
  4. 4.
    J. Larrosa, P. Meseguer, and T. Schiex. Maintaining reversible dac for max-csp. Artificial Intelligence, 107:149–163, 1999.zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    J. Larrossa and P. Meseguer. Partition-based lower bound for max-csp. Proceedings CP, pages 303–315, 1999.Google Scholar
  6. 6.
    T. Petit, J. Régin, and C. Bessière. Meta constraints on violations for over constrained problems. Proceedings ICTAI, 2000.Google Scholar
  7. 7.
    P. Van Hentenryck. Constraint satisfaction in logic programming. The MIT Press, 1989.Google Scholar
  8. 8.
    G. Verfaillie, M. Lemaître, and T. Schiex. Russian doll search for solving constraint optimisation problems. Proceedings AAAI, pages 181–187, 1996.Google Scholar
  9. 9.
    R. Wallace. Directed arc consistency preprocessing as a strategy for maximal constraint satisfaction. Proceedings ECAI, pages 69–77, 1994.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Jean-Charles Régin
    • 1
  • Thierry Petit
    • 1
    • 2
  • Christian Bessière
    • 2
  • Jean-François Puget
    • 3
  1. 1.ILOGValbonneFRANCE
  2. 2.LIRMM (UMR 5506 CNRS)Montpellier Cedex 5FRANCE
  3. 3.ILOGGentilly CedexFRANCE

Personalised recommendations