Sciweavers

76 search results - page 4 / 16
» Extending to Soft and Preference Constraints a Framework for...
Sort
View
CONSTRAINTS
2010
126views more  CONSTRAINTS 2010»
13 years 7 months ago
Lexicographically-ordered constraint satisfaction problems
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
Eugene C. Freuder, Robert Heffernan, Richard J. Wa...
CP
2000
Springer
13 years 11 months ago
Constraint Propagation for Soft Constraints: Generalization and Termination Conditions
Soft constraints based on semirings are a generalization of classical constraints, where tuples of variables' values in each soft constraint are uniquely associated to element...
Stefano Bistarelli, Rosella Gennari, Francesca Ros...
ICLP
2005
Springer
14 years 27 days 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
AAAI
2004
13 years 8 months ago
Low-cost Addition of Preferences to DTPs and TCSPs
We present an efficient approach to adding soft constraints, in the form of preferences, to Disjunctive Temporal Problems (DTPs) and their subclass Temporal Constraint Satisfactio...
Bart Peintner, Martha E. Pollack
BPM
2006
Springer
115views Business» more  BPM 2006»
13 years 11 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