Abstract
The paper discusses the use of product-based possibilistic networks for representing conditional preference statements on discrete variables. The approach uses non-instantiated possibility weights to define conditional preference tables. Moreover, additional information about the relative strengths of symbolic weights can be taken into account. It yields a partial preference order among possible choices corresponding to a symmetric form of Pareto ordering. In the case of Boolean variables, this partial ordering coincides with the inclusion between the sets of preference statements that are violated. Furthermore, this graphical model has two logical counterparts in terms of possibilistic logic and penalty logic. The flexibility and the representational power of the approach are stressed. Besides, algorithms for handling optimization and dominance queries are provided.
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
References
Ben Amor, N., Dubois, D., Gouider, H., Prade, H.: Possibilistic networks: a new setting for modeling preferences. In: Straccia, U., Calì, A. (eds.) SUM 2014. LNCS, vol. 8720, pp. 1–7. Springer, Heidelberg (2014)
Ben Amor, N., Benferhat, S., Mellouli, K.: Anytime possibilistic propagation algorithm. In: Proceedings of the 1st International Conference Computing in an Imperfect World, pp. 263–279 (2002)
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., Brafman, R.I.: 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.: Introducing Variable Importance Tradeoffs Into CP-nets. CoRR, New York (2013)
Dawid, A.P.: Applications of a general propagation algorithm for probabilistic expert systems. Stat. Comput. 2(1), 25–36 (1992)
Dupin de Saint-Cyr, F., Lang, J., Schiex, T.: Penalty logic and its link with Dempster-Shafer theory. In: Proceedings of the 10th Conference UAI, pp. 204–211, Morgan Kaufmann (1994)
Dubois, D., Prade, H.: Possibilistic logic: a retrospective and prospective view. Fuzzy Sets Syst. 144(1), 3–23 (2004)
Dubois, D., Prade, H., Touazi, F.: Conditional Preference-nets, possibilistic logic, and the transitivity of priorities. In: Proceedings of the 33rd SGAI Intenational Conference, pp. 175–184. Springer, Heidelberg (2013)
Goldsmith, J., Lang, J., Truszczynski, M., Wilson, N.: The computational complexity of dominance and consistency in CP-nets. J. Artif. Intell. Res. 33, 403–432 (2008)
Gonzales, C., Perny, N.: GAI networks for utility elicitation. In: Proceedings of the 9th International Conference Principles of Knowledge Representation and Reasoning, pp. 224–234 (2004)
Jensen, F.V., Lauritzen, S.L., Olesen, K.G.: Bayesian updating in causal probabilistic networks by local computations. Comput. Stat. Q. 4, 269–282 (1990)
Nilsson, D.: An efficient algorithm for finding the m most probable configurations in probabilistic expert systems. Stat. Comput. 8(2), 159–173 (1998)
Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmman, San Francisco (1988)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Ben Amor, N., Dubois, D., Gouider, H., Prade, H. (2015). Possibilistic Conditional Preference Networks. In: Destercke, S., Denoeux, T. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2015. Lecture Notes in Computer Science(), vol 9161. Springer, Cham. https://doi.org/10.1007/978-3-319-20807-7_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-20807-7_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-20806-0
Online ISBN: 978-3-319-20807-7
eBook Packages: Computer ScienceComputer Science (R0)