Soft Constraint Propagation and Solving in CHR. Bistarelli, S., Fruewirth, T., Marte, M., & Rossi, F. 2002.
abstract   bibtex   
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.
@conference{
	11391_142684,
	author = {Bistarelli, Stefano and Fruewirth, Thom and Marte, Michael and Rossi, Francesca},
	title = {Soft Constraint Propagation and Solving in CHR},
	year = {2002},
	publisher = {ACM Press},
	booktitle = {Proceedings of the 2002 ACM Symposium on Applied Computing (SAC)},
	abstract = {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.},
	pages = {1--5}
}

Downloads: 0