Sciweavers

241 search results - page 1 / 49
» Relational preference rules for control
Sort
View
AI
2011
Springer
12 years 11 months ago
Relational preference rules for control
Much like relational probabilistic models, the need for relational preference models arises naturally in real-world applications where the set of object classes is fixed, but obj...
Ronen I. Brafman
LOGCOM
2002
92views more  LOGCOM 2002»
13 years 4 months ago
Operators and Laws for Combining Preference Relations
The paper is a theoretical study of a generalization of the lexicographic rule for combining ordering relations. We define the concept of priority operator: a priority operator ma...
Hajnal Andréka, Mark Ryan, Pierre-Yves Scho...
AAAI
2004
13 years 6 months ago
A Computational Study of the Kemeny Rule for Preference Aggregation
We consider from a computational perspective the problem of how to aggregate the ranking preferences of a number of alternatives by a number of different voters into a single cons...
Andrew J. Davenport, Jayant Kalagnanam
ASP
2005
Springer
13 years 10 months ago
Intelligence Analysis Using Quantitative Preferences
The extended answer set semantics for simple logic programs, i.e. programs with only classical negation, allows for the defeat of rules to resolve contradictions. In addition, a pa...
Davy Van Nieuwenborgh, Stijn Heymans, Dirk Vermeir
DIS
1998
Springer
13 years 9 months ago
Learning with Globally Predictive Tests
We introduce a new bias for rule learning systems. The bias only allows a rule learner to create a rule that predicts class membership if each test of the rule in isolation is pred...
Michael J. Pazzani