An Original Constraint Based Approach for Solving over Constrained Problems

  title={An Original Constraint Based Approach for Solving over Constrained Problems},
  author={Jean-Charles R{\'e}gin and Thierry Petit and Christian Bessiere and Jean-François Puget},
In this paper we present a new framework for over constrained problems. We suggest to define an over-constrained network as a global constraint. We introduce two new lower bounds of the number of violations, without making any assumption on the arity of constraints. 
Over-Constrained Problems
This chapter, an overview of recent developments in solution methods for over-constrained problems using constraint programming is presented, with an emphasis on soft global constraints.
Enforcing Solutions in Constraint Networks
A method is proposed to enforce specific solutions in constraint networks that yields a set of constraints to be dropped whose cardinality is minimal.
Global Propagation of Practicability Constraints
The advantages of a variable-based framework for solving over-constrained problems with practicability constraints and the case-study is a cumulative scheduling problem with over-loads.
Current Approaches for Solving Over-Constrained Problems
This work summarizes existing approaches to model and solve overconstrained problems, and different specific and generic formalisms are discussed, including the special case of multi-objective optimization.
Specific Filtering Algorithms for Over-Constrained Problems
This paper presents a paradigm that places no restrictions on the constraint filtering algorithms used by associating specific filtering algorithms with constraints that may be violated in over-constrained problems.
Global Constraints: A Survey
A collection of the most frequently used global constraints is given and some filtering algorithms are detailed, to identify how filtering algorithms can be designed and some problems that deserve to be addressed in the future.
The alldifferent Constraint: A Survey
A practical overview and an abstract comparison of several solving strategies for the constraint of difference in constraint pro- gramming are given.
Constraint-Based Rostering
The emphasis is on the choice of constraints which efficiently exploit the substructures of rostering problems, on the way to occasionally bend the rules in order to handle overconstrained instances, and on generic search heuristics built from the constraints in the model.
Lower Bounds for Non-binary Constraint Optimization Problems
This work analyzes several lower bounds proposed in the binary case, extending them for the non-binary case, and shows that techniques initially developed in the context of reversible DAC can be applied in the general case, to deal with constraints of any arity.
On global warming: Flow-based soft global constraints
This work proposes a generic method to soften global constraints that can be represented by a flow in a graph, and presents efficient propagation algorithms, based on different violation measures, achieving domain consistency for the alldifferent constraint, the global cardinality constraints, the regular constraint and the same constraint.


Maintaining Reversible DAC for Max-CSP
Partition-Based Lower Bound for Max-CSP
A partition-based lower bound is introduced, which is superior to previous ones based on individual contributions and provides experimental evidence for the superiority of the new algorithms on random problems and real instances of weighted over-constrained problems.
Partial Constraint Satisfaction
Meseguer . Partitionbased lower bound for maxsp
  • Pro eedingsCP
  • 1999
Dire ted ar onsisten y prepro essing as a strategy for maximal onstraint satisfa tion
  • Pro eedings ECAI
  • 1994
Problem lassi ation s heme for nite domain onstraint solving
  • CPWorkshop on
Partial onstraint satisfa tion
  • Arti ial Intelligen e
  • 1992
Maintaining reversible da for maxsp
  • Arti ial Intelligen e
  • 1999