Name
Abstract | ||
|---|---|---|
Soft constraints based on semirings are a generalization of classical constraints, where tuples of variables' values in each soft constraint are associated to elements from an algebraic structure called semiring. This framework is able to express, for example, fuzzy, classical, weighted, valued and over-constrained constraint problems.Classical constraint propagation has been extended and adapted to soft constraints by defining a schema for soft constraint propagation [8]. On the other hand, in [1–3] it has been proven that most of the well known constraint propagation algorithms for classical constraints can be cast within a single schema.In this paper we combine these two schemas and we provide a more general framework where the schema of [3] can be used for soft constraints. In doing so, we generalize the concept of soft constraint propagation, and we provide new sufficient and independent conditions for its termination. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1023/A:1021950728713 | Constraints |
Keywords | Field | DocType |
soft constraints,soft constraint propagation,termination,semiring,generic algorithm schema | Discrete mathematics,Constraint satisfaction,Local consistency,Mathematical optimization,Constraint graph,Constraint programming,Algorithm,Constraint learning,Constraint logic programming,Mathematics,Hybrid algorithm (constraint satisfaction),Binary constraint | Journal |
Volume | Issue | ISSN |
8 | 1 | 1572-9354 |
Citations | PageRank | References |
2 | 0.53 | 10 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Stefano Bistarelli | 1 | 1317 | 105.40 |
| Rosella Gennari | 2 | 2 | 0.53 |
| F. Rossi | 3 | 713 | 48.69 |