Reasoning with Conditional Ceteris Paribus Preference Statements
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 (ali 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.
Cite
Text
Boutilier et al. "Reasoning with Conditional Ceteris Paribus Preference Statements." Conference on Uncertainty in Artificial Intelligence, 1999.Markdown
[Boutilier et al. "Reasoning with Conditional Ceteris Paribus Preference Statements." Conference on Uncertainty in Artificial Intelligence, 1999.](https://mlanthology.org/uai/1999/boutilier1999uai-reasoning/)BibTeX
@inproceedings{boutilier1999uai-reasoning,
title = {{Reasoning with Conditional Ceteris Paribus Preference Statements}},
author = {Boutilier, Craig and Brafman, Ronen I. and Hoos, Holger H. and Poole, David},
booktitle = {Conference on Uncertainty in Artificial Intelligence},
year = {1999},
pages = {71-80},
url = {https://mlanthology.org/uai/1999/boutilier1999uai-reasoning/}
}