Anytime propagation algorithm for min-based possibilistic graphs

Soft Computing

Volumn 8, Issue 2, 2003, Pages 150-161

  Ben Amor, N ^a   Benferhat, S ^b   Mellouli, K ^a  

^a UNIVERSITY OF TUNIS   (Tunisia)

^b UNIVERSITÉ D'ARTOIS   (France)

Author keywords

Anytime propagation algorithm; Graphical models; Possibility theory

Indexed keywords

EID: 10044253964     PISSN: 14327643     EISSN: 14337479     Source Type: Journal    
DOI: 10.1007/s00500-002-0255-x     Document Type: Article

References (16)

1. Amor NB, Benferhat S, Mellouli K (2001) A New Propagation Algorithm for Min-Based Possibilistic Causal Networks, Proceedings of European Conference of Symbolic and Quantitative Approaches to Reasoning and Uncertainty (ECSQARU'2001), pp. 266-277
2. Amor NB, Benferhat S, Dubois D, Geffner H, Prade H (2000) Independence in Qualitative Uncertainty Frameworks. Proceedings of Principles of Knowledge Representation and Reasoning (KR'2000), pp. 235-246
3. Benferhat S, Dubois D, Garcia L, Prade H (1999) Possibilistic logic bases and possibilistic graphs, Proceedings of the Fifteenth Conference on Uncertainty in Artificial Intelligence (UAI'99), pp. 57-64
4. Borgelt C, Gebhardt J, Kruse R (1998) Possibilistic Graphical Models, Proceedings of International School for the Synthesis of Expert Knowledge (ISSEK'98)
5. de Campos LM, Huete JF (1999) Independence concepts in possibility theory:Part I, Fuzzy Sets and Systems 103: 127-152
6. Cooper GF (1990) Computational complexity of probabilistic inference using Bayesian belief networks, Artificial Intelligence, 42: 393-405
7. Dubois D, Prade H (1988) Possibility theory: An approach to computerized, Processing of uncertainty, Plenum Press, New York
8. Dubois D, Lang J, Prade H (1994) Possibilistic logic, In: Handbook of logic in Artificial intelligence and logic programming, Oxford University press, 3: 439-513
9. Fargier H (1994) Problmes de satisfaction de contraintes flexibles-application l'ordonnancement de production, Thèse de l'Universit P. Sabatier, Toulouse, France
10. Fonck P (1992) Propagating uncertainty in a directed acyclic graph, Proceedings of International Conference on Information Processing of Uncertainty in Knowledge Based Systems (IPMU'92), pp. 17-20
11. Fonck P (1994) Conditional independence in possibility theory, Proceedings of the Tenth Conference on Uncertainty in Artificial Intelligence (UAI'94), pp. 221-226
12. Gebhardt J, Kruse R (1997) Background and perspectives of possibilistic graphical models, Proceedings of European Conference of Symbolic and Quantitative Approaches to Reasoning and Uncertainty (ECSQARU'1997), pp. 108-121
13. Heckerman D (1989) A tractable inference algorithm for diagnosing multiple diseases, Proceedings of Fifth Workshop on Uncertainty in Artificial Intelligence (UAI'89), pp. 163-171
14. Hisdal E (1978) Conditional possibilities independence and non interaction, Fuzzy Sets and Systems 1: 283-297
15. Jensen FV (1996) Introduction to Bayesien networks, UCL Press, University college, London
16. Zadeh LA (1978) Fuzzy sets as a basis for a theory of possibility, Fuzzy Sets and Systems 1: 3-28