Handbook of logic in artificial intelligence and logic programming (vol. 3)
Beyond min aggregation in multicriteria decision: (ordered) weighted min, discri-min, leximin
The ordered weighted averaging operators
System Z: a natural ordering of defaults with tractable applications to nonmonotonic reasoning
TARK '90 Proceedings of the 3rd conference on Theoretical aspects of reasoning about knowledge
International Journal of Approximate Reasoning
Database querying under changing preferences
Annals of Mathematics and Artificial Intelligence
An Efficient Upper Approximation for Conditional Preference
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Journal of Artificial Intelligence Research
Ranking alternatives on the basis of generic constraints and examples: a possibilistic approach
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Database preferences queries: a possibilistic logic approach with symbolic priorities
FoIKS'08 Proceedings of the 5th international conference on Foundations of information and knowledge systems
Reasoning with conditional ceteris paribus preference statements
UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
Introducing variable importance tradeoffs into CP-nets
UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
Preferences in AI: An overview
Artificial Intelligence
Database preference queries--a possibilistic logic approach with symbolic priorities
Annals of Mathematics and Artificial Intelligence
Conditional preference nets and possibilistic logic
ECSQARU'13 Proceedings of the 12th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Sorted-Pareto dominance and qualitative notions of optimality
ECSQARU'13 Proceedings of the 12th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
| Hi-index | 0.00 |
The paper proposes a new approach to the handling of preferences expressed in a compact way under the form of conditional statements. These conditional statements are translated into classical logic formulas associated with symbolic levels. Ranking two alternatives then leads to compare their respective amount of violation with respect to the set of formulas expressing the preferences. These symbolic violation amounts, which can be computed in a possibilistic logic manner, can be partially ordered lexicographically once put in a vector form. This approach is compared to the ceteris paribus-based CP-net approach, which is the main existing artificial intelligence approach to the compact processing of preferences. It is shown that the partial order obtained with the CP-net approach fully agrees with the one obtained with the proposed approach, but generally includes further strict preferences between alternatives (considered as being not comparable by the symbolic level logic-based approach). These additional strict preferences are in fact debatable, since they are not the reflection of explicit user's preferences but the result of the application of the ceteris paribus principle that implicitly, and quite arbitrarily, favors father node preferences in the graphical structure associated with conditional preferences. Adding constraints between symbolic levels for expressing that the violation of father nodes is less allowed than the one of children nodes, it is shown that it is possible to recover the CP-net-induced partial order. Due to existing results in possibilistic logic with symbolic levels, the proposed approach is computationally tractable. Key words: preference, priority, partial order, CP-net, possibilistic logic.