2013/01/23 by Craig Boutilier, Ronen I. Brafman, Boutilier, Craig +5
Computer Science · #Advanced Database Systems and Queries #Artificial Intelligence (cs.AI) #Constraint Satisfaction and Optimization #Data Management and Algorithms #FOS: Computer and information sciences
paper · pdf · doi:10.48550/arxiv.1301.6681
openalex publication_date 2013/01/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.