Using Hard Constraints for Representing Soft Constraints [chapter]

Jean-Charles Régin
2011 Lecture Notes in Computer Science  
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
more » ... d 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.
doi:10.1007/978-3-642-21311-3_17 fatcat:6uwiueodxjhmrhdwoonswyoige