Reasoning with conditional ceteris paribus preference statements (1999)
Cached
Download Links
| Venue: | In Proceedings of the Fifteenth Conference on Uncertainty in Artificial Intelligence |
| Citations: | 96 - 16 self |
BibTeX
@INPROCEEDINGS{Boutilier99reasoningwith,
author = {Craig Boutilier and Ronen I. Brafman and Holger H. Hoos and David Poole},
title = {Reasoning with conditional ceteris paribus preference statements},
booktitle = {In Proceedings of the Fifteenth Conference on Uncertainty in Artificial Intelligence},
year = {1999},
pages = {71--80}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In many domains it is desirable to assess the preferences of users in a qualitative rather than quantitative way. Such representations of qualitative preference orderings form an important component of automated decision tools. We propose a graphical representation of preferences that reflects conditional dependence and independence of preference statements under a ceteris paribus (all else being equal) interpretation. Such a representation is often compact and arguably natural. We describe several search algorithms for dominance testing based on this representation; these algorithms are quite effective, especially in specific network topologies, such as chain- and treestructured networks, as well as polytrees. 1
