Uncertainty in Artificial Intelligence
First Name   Last Name   Password   Forgot Password   Log in!
    Proceedings         Authors   Author's Info   Article details         Search    
Reasoning With Conditional Ceteris Paribus Preference Statem
Craig Boutilier, Ronen Brafman, Holger Hoos, David Poole
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 importnat 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 ofetn 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 tree- structured networks, as well as polytrees.
Keywords:
Pages: 71-80
PS Link: ftp://ftp.cs.ubc.ca/ftp/local/poole/papers/cpnets.ps
PDF Link: /papers/99/p71-boutilier.pdf
BibTex:
@INPROCEEDINGS{Boutilier99,
AUTHOR = "Craig Boutilier and Ronen Brafman and Holger Hoos and David Poole",
TITLE = "Reasoning With Conditional Ceteris Paribus Preference Statem",
BOOKTITLE = "Proceedings of the Fifteenth Conference Annual Conference on Uncertainty in Artificial Intelligence (UAI-99)",
PUBLISHER = "Morgan Kaufmann",
ADDRESS = "San Francisco, CA",
YEAR = "1999",
PAGES = "71--80"
}


hosted by DSL   •   site info   •   help