Reasoning with conditional ceteris paribus preference statements

  • Authors:

  • Craig Boutilier;Ronen I. Brafman;Holger H. Hoos;David Poole

  • Affiliations:

  • Dept. of Computer Science, University of British Columbia, Vancouver, BC;Department of Math and CS, Ben-Gurion University, Beer Sheva, Israel;Dept. of Computer Science, University of British Columbia, Vancouver, BC;Dept. of Computer Science, University of British Columbia, Vancouver, BC

  • Venue:
  • UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

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.