# Reasoning With Conditional Ceteris Paribus Preference Statem

arXiv: https://arxiv.org/abs/1301.6681 · HTML: https://mlsanity.com/paper/1301.6681/

## Key facts

- Cited by 5 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 23 Jan 2013.

## Built on by (most cited first, 5 of 5)

- [An extended Knowledge Compilation Map for Conditional Preference Statements-based and Generalized Additive Utilities-based Languages](https://mlsanity.com/paper/2102.04107/) (2021)
- [The complexity of unsupervised learning of lexicographic preferences](https://mlsanity.com/paper/2209.11505/) (2022)
- [What is a decision problem?](https://mlsanity.com/paper/2301.02758/) (2023)
- [Efficient Inference and Computation of Optimal Alternatives for Preference Languages Based On Lexicographic Models](https://mlsanity.com/paper/2410.23913/) (2024)
- [Towards Fast Algorithms for the Preference Consistency Problem Based on Hierarchical Models](https://mlsanity.com/paper/2410.23934/) (2024)

## Abstract (arXiv)

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.