Sciweavers

365 search results - page 1 / 73
» Local Computation Schemes with Partially Ordered Preferences
Sort
View
ECSQARU
2009
Springer
13 years 10 months ago
Local Computation Schemes with Partially Ordered Preferences
Many computational problems linked to reasoning under uncertainty can be expressed in terms of computing the marginal(s) of the combination of a collection of (local) valuation fun...
Hélène Fargier, Nic Wilson
CONSTRAINTS
2010
116views more  CONSTRAINTS 2010»
13 years 1 months ago
Enabling local computation for partially ordered preferences
Abstract. Many computational problems linked to uncertainty and preference management can be expressed in terms of computing the marginal(s) of a combination of a collection of val...
Hélène Fargier, Emma Rollon, Nic Wil...
ECAI
2006
Springer
13 years 8 months ago
Computing Possible and Necessary Winners from Incomplete Partially-Ordered Preferences
Maria Silvia Pini, Francesca Rossi, Kristen Brent ...
ATAL
2006
Springer
13 years 8 months ago
Strategic voting when aggregating partially ordered preferences
Preferences of a single agent are often partially ordered. For example, it may be hard to compare a novel with a biography. In such a situation, the agent may want the novel and t...
Maria Silvia Pini, Francesca Rossi, Kristen Brent ...
HEURISTICS
2006
102views more  HEURISTICS 2006»
13 years 4 months ago
A logic of soft constraints based on partially ordered preferences
Representing and reasoning with an agent's preferences is important in many applications of constraints formalisms. Such preferences are often only partially ordered. One clas...
Nic Wilson