Soft Constraint Propagation and Solving in Constraint Handling Rules

Soft constraints are a generalization of classical constraints, which allow for the description of preferences rather than strict requirements. In soft constraints, constraints and partial assignments are given preference or importance levels, and constraints are combined according to combinators which express the desired optimization criteria. On the other hand, Constraint Handling Rules (CHR) constitute a high-level natural formalism to specify constraint solvers and propagation algorithms. We present a framework to design and specify soft constraint solvers by using CHR. In this way, we extend the range of applicability of CHR to soft constraints rather than just classical ones, and we provide a straightforward implementation for soft constraint solvers.

• Type: Journal
• Year: 2004
• Where: CI
• Authors: Stefano Bistarelli, Thom W. Frühwirth, Michael Marte, Francesca Rossi
• Keywords: CI 2004, Constraint Solvers, Soft Constraint, Soft Constraint Solvers