Possibilistic networks with locally weighted knowledge bases

4th International Symposium on Imprecise Probabilities and Their Applications, ISIPTA 2005

Volumn , Issue , 2005, Pages

  Benferhat, Salem ^a   Smaoui, Salma ^a  

^a UNIVERSITÉ D'ARTOIS   (France)

Author keywords

Possibilistic logic; Possibilistic networks

Indexed keywords

BACKPROPAGATION; PROBABILITY;

COMPACT REPRESENTATION; KNOWLEDGE BASIS; POSSIBILISTIC; POSSIBILISTIC LOGIC; POSSIBILISTIC NETWORKS; POSSIBILITY DISTRIBUTIONS; PROPAGATION ALGORITHM;

COMPUTER CIRCUITS;

EID: 77954090377     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. N. Benamor. Qualitative possibilistic graphical models: From independence to propagation algorithms. PHD Thesis, Institut supérieur de gestion: Tunis, 2002.
2. S. Benferhat, D. Dubois, L. Garcia, H. Prade. On the transformation between possibilistic logic bases and possibilistic causal networks. International Journal of Approximate Reasoning, Vol. 29, N. 21, 35-173, 2002.
3. S. Benferhat, S. Smaoui. Hybrid possibilistic networks. To appear in proceeding of the Twentieth National Conference on Artificial Intelligence (AAAI-05),AAAI Press. Pittsburgh, 2005.
4. G. De Cooman, E. E. Kerre. A new approach to possibilistic independence. Proceeding of the Third IEEE International Conference on Fuzzy Systems, 1994, pp. 1446-1451.
5. G. F. Cooper. Computational complexity of probabilistic inference using Bayesian belief networks. Artificial Intelligence, vol 42, 393-405, 1990.
6. A. Darwiche and P. Marquis. Compiling propositional weighted bases. Artif. Intell.,Elsevier Science Publishers Ltd. vol 157, number 1-2, pp.81-113,Essex, UK.
7. A. Darwiche. New Advances in Compiling CNF into Decomposable Negation Normal Form. ECAI 2004: pp.328-332
8. D. Dubois,J. Lang, H. Prade. Possibilistic logic. Handbook on Logic in Artificial Intelligence and Logic Programming. vol 3, pp.439-513. Oxford University press, 1994.
9. D. Dubois, H. Prade. Possibility theory: An approach to computerized processing of uncertaincy.Plenum Press, New York, 1988.
10. P. Fonck. A Comparative Study of Possibilistic Conditional Independence and Lack of Interaction. International Journal of Approximate Reasoning, vol 16, 149-171, 1997.
11. P. Fonck. Réseaux d’inférence pour le raisonnement possibiliste. Université de Liège, Faculté des Science, 1994.
12. L. Hernandez, S. Moral. Inference with Idempotent Valuations. Proceedings of the 13th Annual Conference on Uncertainty in Artificial Intelligence (UAI-97): 229-237, San Francisco, CA,1997,Morgan Kaufmann Publishers.
13. E. Hisdal. Conditional possibilities independence and non interaction. Fuzzy Sets ans Systems, 1:283-297, 1978.
14. F. V. Jensen. Introduction to Bayesien networks, UCL Press, University college, London, 1996.
15. J. Lang, P. Marquis. Complexity results for independence and definability. Proceeding of the 6th International Conference on Knowledge Representation and Reasoning (KR’98): 356-367, Trento, 1998.
16. J. Lang. Possibilistic logic: complexity and algorithms. Handbook of Defeasible Reasoning and Uncertainty Management Systems (D. Gabbay and Ph. Smets, eds.): Vol. 5, 179-220, 2000, Kluwer Academic Publishers.
17. S. L. Lauritzen,D. J. Spiegelhalter. Local computations with probabilities on graphical structures and their application to expert systems. Journal of the Royal Statistical Society , vol 50, pp.157-224, 1988.
18. F. Lin, R. Reiter. Forget it!. Proceeding of AAAI Fall Symposium on Relevance: 154-159, New Orleans (LA), 1994.
19. J. Pearl. Probabilistic reasoning in intelligent systems: networks of plausible inference. San Francisco (California). Morgan Kaufmman, 1988.
20. N. Wilson, J. Mengin. Logical deduction using the local computation framework. Lecture Notes in Computer Science: vol 1638, pp. 386–??,1999.
21. N. Wilson, J. Mengin. Embedding logics in the local computation framework. Journal of Applied Non-Classical Logics, vol 11(3-4): 239-267, 2001.