Sciweavers

28 search results - page 2 / 6
» From soft constraints to bipolar preferences: modelling fram...
Sort
View
AI
2010
Springer
13 years 4 months ago
Elicitation strategies for soft constraint problems with missing preferences: Properties, algorithms and experimental studies
We consider soft constraint problems where some of the preferences may be unspecified. This models, for example, settings where agents are distributed and have privacy issues, or ...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...
BPM
2006
Springer
115views Business» more  BPM 2006»
13 years 8 months ago
Modeling, Matching and Ranking Services Based on Constraint Hardness
A framework for modeling Semantic Web Service is proposed. It is based on Description Logic (DL), hence it is endowed with a formal semantics and, in addition, it allows for expres...
Claudia d'Amato, Steffen Staab
ICLP
2005
Springer
13 years 10 months ago
Preference Reasoning
Abstract. Constraints and preferences are ubiquitous in real-life. Moreover, preferences can be of many kinds: qualitative, quantitative, conditional, positive or negative, to name...
Francesca Rossi
AIPS
2004
13 years 6 months ago
Domain-Specific Preferences for Causal Reasoning and Planning
We address the issue of incorporating domain-specific preferences in planning systems, where a preference may be seen as a "soft" constraint that it is desirable, but no...
James P. Delgrande, Torsten Schaub, Hans Tompits
MOZ
2004
Springer
13 years 10 months ago
Implementing Semiring-Based Constraints Using Mozart
Abstract. Although Constraint Programming (CP) is considered a useful tool for tackling combinatorial problems, its lack of flexibility when dealing with uncertainties and prefere...
Alberto Delgado, Carlos Alberto Olarte, Jorge Andr...