TY - GEN
T1 - CP-Nets, π-pref Nets, and Pareto Dominance
AU - Wilson, Nic
AU - Dubois, Didier
AU - Prade, Henri
N1 - Publisher Copyright:
© Springer Nature Switzerland AG 2019.
PY - 2019
Y1 - 2019
N2 - Two approaches have been proposed for the graphical handling of qualitative conditional preferences between solutions described in terms of a finite set of features: Conditional Preference networks (CP-nets for short) and more recently, Possibilistic Preference networks (π-pref nets for short). The latter agree with Pareto dominance, in the sense that if a solution violates a subset of preferences violated by another one, the former solution is preferred to the latter one. Although such an agreement might be considered as a basic requirement, it was only conjectured to hold as well for CP-nets. This non-trivial result is established in the paper. Moreover it has important consequences for showing that π-pref nets can at least approximately mimic CP-nets by adding explicit constraints between symbolic weights encoding the ceteris paribus preferences, in case of Boolean features. We further show that dominance with respect to the extended π-pref nets is polynomial.
AB - Two approaches have been proposed for the graphical handling of qualitative conditional preferences between solutions described in terms of a finite set of features: Conditional Preference networks (CP-nets for short) and more recently, Possibilistic Preference networks (π-pref nets for short). The latter agree with Pareto dominance, in the sense that if a solution violates a subset of preferences violated by another one, the former solution is preferred to the latter one. Although such an agreement might be considered as a basic requirement, it was only conjectured to hold as well for CP-nets. This non-trivial result is established in the paper. Moreover it has important consequences for showing that π-pref nets can at least approximately mimic CP-nets by adding explicit constraints between symbolic weights encoding the ceteris paribus preferences, in case of Boolean features. We further show that dominance with respect to the extended π-pref nets is polynomial.
UR - https://www.scopus.com/pages/publications/85078412472
U2 - 10.1007/978-3-030-35514-2_13
DO - 10.1007/978-3-030-35514-2_13
M3 - Conference proceeding
AN - SCOPUS:85078412472
SN - 9783030355135
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 169
EP - 183
BT - Scalable Uncertainty Management - 13th International Conference, SUM 2019, Proceedings
A2 - Ben Amor, Nahla
A2 - Quost, Benjamin
A2 - Theobald, Martin
PB - Springer
T2 - 13th International Conference on Scalable Uncertainty Management, SUM 2019
Y2 - 16 December 2019 through 18 December 2019
ER -