Skip to main content

Every complex system can be determined by a causal probabilistic network without cycles and every such network determines a Markov field

  • Contributed Papers
  • Conference paper
  • First Online:
Symbolic and Quantitative Approaches to Uncertainty (ECSQARU 1991)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 548))

  • 125 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ash, R.B.: Real Analysis and Probability. Academic Press: New York, 1972.

    Google Scholar 

  2. Billingsley, P.: Convergence of Probability Measures. Wiley: New York. 1968.

    Google Scholar 

  3. Jensen, F.V.: Lauritzen, S.L.: Oleson, K.G.: Bayesian updating in causal probabilistic networks by local computations. Computational Statistics Quaterly 4 (1990), 269–282.

    Google Scholar 

  4. Lauritzen, S.L.: Dawid, A.P.: Larsen, B.N.: Leimer, H.-G.: Independence properties of directed Markov fields. Networks 20 (1990), 491–505.

    Google Scholar 

  5. Lauritzen, S.L.: Spiegelhalter, D.J.: Local computations with probabilities on graphical structures and their applications to expert systems. J. Royal Stat. Soc. B 50 (2) (1988). 157–224.

    Google Scholar 

  6. Neveu, J.: Bases Mathématiques du Calcul des Probabilités. Masson et Cie.: Paris, 1964.

    Google Scholar 

  7. Oppel, U.G.: Kausal-probabilistische Expertensysteme. Vorlesungsskript. Mathematisches Institut der L-M-Universität München, 1991.

    Google Scholar 

  8. Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann: San Mateo, CA. USA; 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Rudolf Kruse Pierre Siegel

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Oppel, U.G. (1991). Every complex system can be determined by a causal probabilistic network without cycles and every such network determines a Markov field. In: Kruse, R., Siegel, P. (eds) Symbolic and Quantitative Approaches to Uncertainty. ECSQARU 1991. Lecture Notes in Computer Science, vol 548. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54659-6_98

Download citation

  • DOI: https://doi.org/10.1007/3-540-54659-6_98

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54659-7

  • Online ISBN: 978-3-540-46426-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics