PUMA
Istituto di Informatica e Telematica     
Bistarelli S., Fruhwirth T., Marte M. Soft Constraint Propagation and Solving in Constraint Handling Rulesin. In: COMPUTATIONAL INTELLIGENCE (11619J0), vol. 20 pp. 287 - 307. ACM, 2004.
 
 
Abstract
(English)
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.
DOI: 10.1145/508791.508793
Subject Constraint reasoning algorithms
F. Theory of Computation F.4 MATHEMATICAL LOGIC AND FORMAL LANGUAGES


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional