Abstract
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 (\(\pi \)-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 \(\pi \)-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 \(\pi \)-pref nets is polynomial.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
If a variable has only one element in its domain, it is a constant, and we could remove it if we wished.
References
Ben Amor, N., Dubois, D., Gouider, H., Prade, H.: Possibilistic preference networks. Inf. Sci. 460–461, 401–415 (2018)
Ben Amor, N., Dubois, D., Gouider, H., Prade, H.: Expressivity of possibilistic preference networks with constraints. In: Moral, S., Pivert, O., Sánchez, D., Marín, N. (eds.) SUM 2017. LNCS (LNAI), vol. 10564, pp. 163–177. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-67582-4_12
Benferhat, S., Dubois, D., Garcia, L., Prade, H.: On the transformation between possibilistic logic bases and possibilistic causal networks. Int. J. Approx. Reasoning 29(2), 135–173 (2002)
Boutilier, C., Bacchus, F., Brafman, R.I.: UCP-networks: a directed graphical representation of conditional utilities. In: Proceedings of the 17th Conference on Uncertainty in AI, Seattle, Washington, USA, pp. 56–64 (2001)
Boutilier, C., Brafman, R.I., Hoos, H.H., Poole, D.: Reasoning with conditional ceteris paribus preference statements. In: Proceedings of the 15th Conference on Uncertainty in AI, Stockholm, Sweden, pp. 71–80 (1999)
Boutilier, C., Brafman, R.I., Domshlak, C., Hoos, H.H., Poole, D.: CP-nets: a tool for representing and reasoning with conditional ceteris paribus preference statements. J. Artif. Intell. Res. 21, 135–191 (2004)
Brafman, R.I., Domshlak, C., Kogan, T.: Compact value-function representations for qualitative preferences. In: Proceedings of the 20th Conference on Uncertainty in AI, Banff, Canada, pp. 51–59 (2004)
Dubois, D., Prade, H.: Possibility Theory: An Approach to ComputerizedProcessing of Uncertainty. Plenum Press (1988)
Dubois, D., Prade, H.: Possibility theory as a basis for preference propagation in automated reasoning. In: Proceedings of the 1st IEEE International Conference on Fuzzy Systems, San Diego, CA, pp. 821–832 (1992)
Acknowledgements
This material is based upon works supported by the Science Foundation Ireland under Grants No. 12/RC/2289 and No. 12/RC/2289-P2 which are co-funded under the European Regional Development Fund.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Wilson, N., Dubois, D., Prade, H. (2019). CP-Nets, \(\pi \)-pref Nets, and Pareto Dominance. In: Ben Amor, N., Quost, B., Theobald, M. (eds) Scalable Uncertainty Management. SUM 2019. Lecture Notes in Computer Science(), vol 11940. Springer, Cham. https://doi.org/10.1007/978-3-030-35514-2_13
Download citation
DOI: https://doi.org/10.1007/978-3-030-35514-2_13
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-35513-5
Online ISBN: 978-3-030-35514-2
eBook Packages: Computer ScienceComputer Science (R0)