Preference-based search and multi-criteria optimization
Eighteenth national conference on Artificial intelligence
Extending CP-nets with stronger conditional preference statements
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Journal of Artificial Intelligence Research
Valued constraint satisfaction problems: hard and easy problems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
The computational complexity of dominance and consistency in CP-nets
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Preferential semantics for goals
AAAI'91 Proceedings of the ninth National conference on Artificial intelligence - Volume 2
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
Hi-index | 0.00 |
The lexicographically-ordered CSP (“lexicographic CSP” for short) combines a simple representation of preferences with the feasibility constraints of ordinary CSPs. Preferences are defined by a total ordering across all assignments, such that a change in assignment to variable k is more important than any change in assignment to any variable that comes after it in the ordering. In this paper, we show how this representation can be extended to handle conditional preferences. This can be done in two ways. In the first, for each conditional preference relation, the parents have higher priority than the children in the original lexicographic ordering. In the second, the relation between parents and children need not correspond to the basic ordering of variables. For problems of the first type, any of the algorithms originally devised for ordinary lexicographic CSPs can also be used when some of the domain orderings are dependent on the assignments to “parent” variables. For problems of the second type, algorithms based on lexical orders can be used if the representation is augmented by variables and constraints that link preference orders to assignments. In addition, the branch-and-bound algorithm originally devised for ordinary lexicographic CSPs can be extended to handle CSPs with conditional domain orderings.