, Christian Bessiere
|
Abstract:
Abstract. In recent years, many works have been carried out to solve over-constrained problems, and more specically 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 take 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 specic ltering 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 satised. 1
Citations
| 383 | Partial constraint satisfaction – Freuder, Wallace - 1992 |
| 357 | Constraint Satisfaction in Logic Programming – Hentenryck - 1989 |
| 65 | Semiringbased CSPs and Valued CSPs: Frameworks, properties, and comparison – Bistarelli, Fargier, et al. - 1999 |
| 48 | Maintaining reversible DAC for Max-CSP – Larrosa, Meseguer, et al. - 1999 |
| 35 | Russian Doll Search for solving constraint optimization problems – Verfaillie, Lemaître, et al. - 1996 |
| 16 | Partition-based lower bound for Max-CSP – Larrosa, Meseguer - 1999 |
| 16 | Directed arc consistency preprocessing as a strategy for maximal constraint satisfaction – Wallace - 1994 |
| 13 | Meta-constraints on violations for over constrained problems – Petit, Régin, et al. - 2000 |
| 7 | Explanation-based generalization of failures – N, Puget - 1988 |
