11 search results - page 1 / 3 » Soft constraint propagation and solving in CHRs |
SAC
2002
ACM
13 years 4 months ago
2002
ACM
Soft constraints are a generalization of classical constraints, where constraints and/or partial assignments are associated to preference or importance levels, and constraints are...
CI
2004
13 years 4 months ago
2004
Soft constraints are a generalization of classical constraints, which allow for the description of preferences rather than strict requirements. In soft constraints, constraints and...
MOZ
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Although Constraint Programming (CP) is considered a useful tool for tackling combinatorial problems, its lack of flexibility when dealing with uncertainties and prefere...
JETAI
2010
13 years 3 months ago
2010
Real-life problems present several kinds of preferences. We focus on problems with both positive and negative preferences, that we call bipolar preference problems. Although seemi...
CSCLP
2006
Springer
13 years 8 months ago
2006
Springer
Real-life problems present several kinds of preferences. We focus on problems with both positive and negative preferences, that we call bipolar preference problems. Although seemin...