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
%0 Generic
%1 Boutilier99
%A Boutilier, Craig
%A Brafman, Ronen I.
%A Hoos, Holger H.
%A Poole, David
%D 1999
%I Morgan Kaufmann Publishers
%K ceteris-paribus preference cp-nets
%P 71--80
%T Reasoning with Conditional Ceteris Paribus Preference Statements
%U http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.48.455
%X 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
@electronic{Boutilier99,
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},
added-at = {2010-10-26T14:46:11.000+0200},
author = {Boutilier, Craig and Brafman, Ronen I. and Hoos, Holger H. and Poole, David},
biburl = {https://www.bibsonomy.org/bibtex/29a72a886b1eb3d3e9bda46c7d93cf084/fnandocl},
citeulike-article-id = {3136077},
citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.48.455},
interhash = {6a935f19d5ce678de9523c01336898e0},
intrahash = {9a72a886b1eb3d3e9bda46c7d93cf084},
keywords = {ceteris-paribus preference cp-nets},
pages = {71--80},
posted-at = {2008-08-19 11:43:09},
priority = {2},
publisher = {Morgan Kaufmann Publishers},
timestamp = {2010-10-26T14:46:11.000+0200},
title = {Reasoning with Conditional Ceteris Paribus Preference Statements},
url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.48.455},
year = 1999
}