zbMATH — the first resource for mathematics

Hybrid possibilistic networks. (English) Zbl 1116.68094
Summary: Possibilistic networks and possibilistic logic are two standard frameworks of interest for representing uncertain pieces of knowledge. Possibilistic networks exhibit relationships between variables while possibilistic logic ranks logical formulas according to their level of certainty. For multiply connected networks, it is well-known that the inference process is a hard problem. This paper studies a new representation of possibilistic networks called hybrid possibilistic networks. It results from combining the two semantically equivalent types of standard representation. We first present a propagation algorithm through hybrid possibilistic networks. This inference algorithm on hybrid networks is strictly more efficient (and confirmed by experimental studies) than the one of standard propagation algorithm.

68T30 Knowledge representation
68T37 Reasoning under uncertainty in the context of artificial intelligence
Full Text: DOI
[1] Lauritzen, S.L.; Spiegelhalter, D.J., Local computations with probabilities on graphical structures and their application to expert systems, Journal of the royal statistical society, 50, 157-224, (1988) · Zbl 0684.68106
[2] Pearl, J., Probabilistic reasoning in intelligent systems: networks of plausible inference, (1988), Morgan Kaufmman San Francisco (California)
[3] P. Fonck, Réseaux d’inférence pour le raisonnement possibiliste, Ph.D. Thesis, Université de Liège, Faculté des Sciences, 1994.
[4] Jensen, F.V., Introduction to bayesien networks, (1996), UCL Press University college, London
[5] Benferhat, S.; Smaoui, S., Hybrid possibilistic networks, (), 584-589
[6] S. Benferhat, S. Smaoui, Possibilistic networks with locally weighted knowledge bases, in: Proceedings of the Fourth International Symposium on Imprecise Probabilities and Their Applications (ISIPTA ’05), Brightdocs, Pittsburgh, USA, 2005, pp. 41-50.
[7] Dubois, D.; Prade, H., Possibility theory: an approach to computerized, processing of uncertainty, (1988), Plenium Press New York
[8] Hisdal, E., Conditional possibilities independence and non interaction, Fuzzy sets and systems, 1, 283-297, (1978) · Zbl 0393.94050
[9] B. Bouchon-Meunier, G. Coletti, C. Marsala, Independence and possibilistic conditioning, in: Annals of Mathematics and Artificial Intelligence, 2002, pp. 107-123. · Zbl 1004.60001
[10] G. de Cooman, E.E. Kerre, A new approach to possibilistic independence, in: Proceedings of the Third IEEE International Conference on Fuzzy Systems, 1994, pp. 1446-1451.
[11] Fonck, P., A comparative study of possibilistic conditional independence and lack of interaction, International journal of approximate reasoning, 16, 149-171, (1997) · Zbl 0939.68115
[12] de Cooman, G., Possibility theory III: possibilistic independence, International journal of general systems, 25, 353-371, (1997) · Zbl 0955.28014
[13] de Campos, L.; Huete, J.F., Independence concepts in possibility theory: part I, Fuzzy sets and systems, 103, 127-152, (1999) · Zbl 0951.68150
[14] Amor, N.B.; Benferhat, S., Graphoid properties of qualitative possibilistic, independence, International journal of uncertainty, fuzziness and knowledge-based, 13, 59-96, (2005) · Zbl 1096.68147
[15] Zadeh, L.A., The concept of a linguistic variable and its application to approximate reasoning, Information science, 9, 43-80, (1975) · Zbl 0404.68075
[16] Dubois, D.; Lang, J.; Prade, H., Possibilistic logic, (), 439-513
[17] Lang, J., Possibilistic logic: complexity and algorithms, Handbook of defeasible reasoning and uncertainty management systems, 5, 179-220, (2000) · Zbl 0984.03022
[18] C. Borgelt, J. Gebhardt, R. Kruse, Possibilistic graphical models, in: Proceedings of International School for the Synthesis of Expert Knowledge (ISSEK’98 ), Udine (Italy), 1998, pp. 51-68. · Zbl 0979.68106
[19] F. Lin, R. Reiter, Forget it!, in: Proceeding of AAAI Fall Symposium on Relevance, 1994, pp. 154-159.
[20] J. Lang, P. Marquis, Complexity results for independence and definability, in: Proceeding of the 6th International Conference on Knowledge Representation and Reasoning (KR’98), 1998, pp. 356-367.
[21] Darwiche, A.; Marquis, P., Compiling propositional weighted bases, Artificial intelligence, 157, 1-2, 81-113, (2004) · Zbl 1085.68166
[22] Benferhat, S.; Dubois, D.; Prade, H., From semantic to syntactic approaches to information combination in possibilistic logic, Aggregation and fusion of imperfect information, studies in fuzziness and soft computing, 141-151, (1997) · Zbl 0898.68079
[23] Benferhat, S.; Dubois, D.; Garcia, L.; Prade, H., On the transformation between possibilistic logic bases and possibilistic causal networks, International journal of approximate reasoning, 29, 2, 135-173, (2002) · Zbl 1015.68204
[24] Wilson, N.; Mengin, J., Embedding logics in the local computation framework, Journal of applied non-classical logics, 11, 3-4, 239-267, (2001) · Zbl 1032.03032
[25] Mengin, J.; Wilson, N., Logical deduction using the local computation framework, Lecture notes in computer science, 386-396, (1999) · Zbl 0934.03018
[26] Hernandez, L.; Moral, S., Inference with idempotent valuations, (), 229-237
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.