Logical Preference Representation and Combinatorial Vote
Annals of Mathematics and Artificial Intelligence
Extending CP-nets with stronger conditional preference statements
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Constraint-based preferential optimization
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Journal of Artificial Intelligence Research
The computational complexity of dominance and consistency in CP-nets
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
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
Relaxing Ceteris Paribus Preferences with Partially Ordered Priorities
ECSQARU '07 Proceedings of the 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Mastering the Processing of Preferences by Using Symbolic Priorities in Possibilistic Logic
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
An Efficient Deduction Mechanism for Expressive Comparative Preferences Languages
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
The computational complexity of dominance and consistency in CP-Nets
Journal of Artificial Intelligence Research
Efficient inference for expressive comparative preference languages
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Learning conditionally lexicographic preference relations
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Preferences in AI: An overview
Artificial Intelligence
Computational techniques for a simple theory of conditional preferences
Artificial Intelligence
Pruning rules for constrained optimisation for conditional preferences
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Hi-index | 0.00 |
The fundamental operation of dominance testing, i.e., determining if one alternative is preferred to another, is in general very hard for methods of reasoning with qualitative conditional preferences such as CP-nets and conditional preference theories (CP-theories). It is therefore natural to consider approximations of preference, and upper approximations are of particular interest, since they can be used within a constraint optimisation algorithm to find some of the optimal solutions. Upper approximations for preference in CP-theories have previously been suggested, but they require consistency, as well as strong acyclicity conditions on the variables. We define an upper approximation of conditional preference for which dominance checking is efficient, and which can be applied very generally for CP-theories.