2002 · 26 citations · 8 references
ComputingComputer ScienceAlgorithmsKnowledge RepresentationOptimizationConstraint HandlingConstraint ModelingConstraint ProgrammingConstraint RepresentationConstraint SatisfactionConstraint SolvingConstraint Handling RulesConstraint OptimizationConstraint PropagationConstraintsPreference ConstraintsPropagation AlgorithmsSoft Constraint Satisfaction
Soft constraints are a generalization of classical constraints, where constraints and/or partial assignments are associated to preference or importance levels, and constraints are combined according to combinators which express the desired optimization criteria. Constraint Handling Rules (CHRs) constitute a high-level natural formalism to specify constraint solvers and propagation algorithms. In this paper we present a framework to design and specify soft constraint solvers by using CHRs. In this way, we extend the range of applicability of CHRs to soft constraints rather than just classical ones, and we provide a straightforward implementation for soft constraint solvers.
8
Semiring-based constraint satisfaction and optimization
Stefano Bistarelli, Ugo Montanari, Francesca Rossi · Journal of the ACM · 1997 · 629 citations · Full text
Partial constraint satisfaction
Eugene C. Freuder, Richard J. Wallace · Artificial Intelligence · 1992 · 614 citations
Johan Andersson, Stefan Andersson, Kent Boortz et al. · 1993 · 310 citations
Compiling constraints in clp(FD)
Philippe Codognet, Daniel Díaz · The Journal of Logic Programming · 1996 · 203 citations