Using Hard Constraints for Representing Soft ConstraintsReport as inadecuate

Using Hard Constraints for Representing Soft Constraints - Download this document for free, or read online. Document in PDF available to download.

* Corresponding author 1 MDSC - Modèles Discrets pour les Systèmes Complexes 2 I3S - Laboratoire d-Informatique, Signaux, et Systèmes de Sophia Antipolis

Abstract : 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 ltering 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 benet from the pruning performance of the ltering algorithm associated with this constraint and from the incremental aspect of these ltering algorithms. In other words, thanks to this schema every ltering algorithm associated with a constraint can still be used when the constraint is soft. The PFC-MRDAC via the Satisability Sum constraint algorithm and the search for disjoint conict sets are then adapted to this new schema.

Author: Jean-Charles Régin -



Related documents