Inference in possibilistic hypergraphs

  • Didier Dubois
  • Henri Prade
5. Non-Standard Logics
Part of the Lecture Notes in Computer Science book series (LNCS, volume 521)


In order to obivate soundness problems in the local treatment of uncertainty in knowledge-based systems, it has been recently proposed to represent dependencies by means of hypergraphs and Markov trees. It has been shown that a unified algorithmic treatment of uncertainties via local propagation is possible on such structures, both for belief functions and Bayesian probabilities, while preserving the soundness and the completeness of the obtained results. This paper points out that the same analysis applies to approximate reasoning based on possibility theory, and discusses the usefulness of the idempotence property for combining possibility distributions, a property not satisfied in probabilistic reasoning. The second part analyzes a previously proposed technique for handling dependencies, by relating it to the hypergraph approach.


Hypergraph Markov trees possibility theory approximate reasoning 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Chatalic P. (1986) Raisonnement déductif en présence de connaissances imprécises et incertaines: un système basé sur la théorie de Dempster-Shafer. Thèse de Doctorat, Univ. P. Sabatier, Toulouse, France.Google Scholar
  2. Chatalic P., Dubois D., Prade H. (1987) A system for handling relational dependencies in approximate reasoning. Proc. of the 3rd Inter. Expert Systems Conf., London, June 2–4, 495–502.Google Scholar
  3. Davis E. (1987) Constraint propagation with interval labels. Artificial Intelligence, 32, 281–331.CrossRefGoogle Scholar
  4. Dubois D., Martin-Clouaire R., Prade H. (1988) Practical computing in fuzzy logic. In: Fuzzy Computing (M.M. Gupta, T. Yamakawa, eds.), North-Holland, 11–34.Google Scholar
  5. Dubois D., Prade H. (1987) A tentative comparison of numerical approximate reasoning methodologies. Int. J. of Man-Machine Studies, 27, 717–728.Google Scholar
  6. Dubois D., Prade H. (1988) On the combination of uncertain or imprecise pieces of information in rule-based systems — A discussion in the framework of possibility theory. Int. J. of Approximate Reasoning, 2, 65–87.CrossRefGoogle Scholar
  7. Dubois D., Prade H. (1989a) Fuzzy arithmetic in qualitative reasoning. In: Modeling and Control of Systems in Engineering, Quantum Mechanics, Economics, and Biosciences (Proc. of the Bellman Continuum Workshop 1988, June 13–14, Sophia Antipolis, France) (A. Blaquière, ed.), Springer Verlag, 457–467.Google Scholar
  8. Dubois D., Prade H. (1989b) Processing fuzzy temporal knowledge. IEEE Trans. on Systems, Man and Cybernetics, 19(4), 729–744.Google Scholar
  9. Dubois D., Prade H. (1989c) A typology of fuzzy "if... then..." rules. Proc. of the 3rd IFSA Congress, University of Washington, Seattle, Aug. 6–11, 782–785.Google Scholar
  10. Fonck P. (1990) Building influence networks in the framework of possibility theory. Proc. of the RP2 First Workshop DRUMS (Defeasible Reasoning and Uncertainty Management Systems), Albi, France, April 26–28, 1990.Google Scholar
  11. Kruse R., Schwecke E. (1988) Fuzzy reasoning in a multi-dimensional space of hypotheses. Proc. of 7th Annual Meeting of the North American Fuzzy Information Processing Society (NAFIPS'88), San Francisco State University, June 8–10, 147–151.Google Scholar
  12. Kruse R., Schwecke E. (1989) On the treatment of cyclic dependencies in causal networks. Proc. of the 3rd IFSA Congress, University of Washington, Seattle, USA, Aug. 6–11, 416–419.Google Scholar
  13. Kruse R., Schwecke E. (1990) Fuzzy reasoning in a multidimensional space of hypotheses. Int. J. of Approximate Reasoning, 4, 47–68.CrossRefGoogle Scholar
  14. Lauritzen S.L., Spiegelhalter D.J. (1988) Local computations with probabilities on graphical structures and their application to expert systems (with discussion). J. of the Royal Statistical Society, B-50, 157–224.Google Scholar
  15. Nilsson N.J. (1986) Probabilistic logic. Artificial Intelligence, 28, 71–87.CrossRefGoogle Scholar
  16. Pearl J. (1986) Fusion, propagation and structuring in belief networks. Artificial Intelligence, 29, 241–288.CrossRefMathSciNetGoogle Scholar
  17. Shafer G. (1976) A Mathematical Theory of Evidence. Princeton University Press.Google Scholar
  18. Shafer G., Shenoy P.P. (1988) Local computation in hypertrees. Working Paper no 201, School of Business, Univ. of Kansas, USA.Google Scholar
  19. Shafer G., Shenoy P.P. (1990) An axiomatic framework for Bayesian and belief-function propagation. In: Uncertainty in Artificial Intelligence, Vol. 4 (R.D. Shachter et al., eds.), North-Holland, Amsterdam, 119–198.Google Scholar
  20. Shafer G., Shenoy P.P., Mellouli K. (1987) Propagating belief functions in qualitative Markov trees. Int. J. Approximate Reasoning, 1, 349–400.CrossRefGoogle Scholar
  21. Williams P.M. (1990) An interpretation of Shenoy and Shafer's axioms for local computation. Int. J. of Approximate Reasoning, 4, 225–232.CrossRefGoogle Scholar
  22. Yager R.R. (1989) Some extensions of constraint propagation of label sets. Int. J. of Approximate Reasoning, 3, 417–435.CrossRefGoogle Scholar
  23. Yager R.R., Larsen H.L. (1990) On discovering potential inconsistencies in validating uncertain knowledge bases by reflecting on the input. In Tech. Report #MII-1001, Machine Intelligence Institute, Iona College, New Rochelle, N.Y..Google Scholar
  24. Zadeh L.A. (1978) Fuzzy sets as a basis for a theory of possibility. Fuzzy Sets and Systems, 1, 3–28.CrossRefGoogle Scholar
  25. Zadeh L.A. (1979) A theory of approximate reasoning. In: Machine Intelligence, Vol. 9 (J.E. Hayes, D. Mikulich, eds.), Elsevier, Amsterdam, 149–194.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Didier Dubois
    • 1
  • Henri Prade
    • 1
  1. 1.Institut de Recherche en Informatique de ToulouseUniversité Paul SabatierToulouse CedexFrance

Personalised recommendations