Skip to main content

Qualitative Markov networks

  • Section II Approaches To Uncertainty A) Evidence Theory
  • Conference paper
  • First Online:
Uncertainty in Knowledge-Based Systems (IPMU 1986)

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.

VII. References

  • Birkhoff, G. (1967). Lattice Theory. American Mathematical Society Colloquium Publications, Vol. XXV, American Mathematical Society, 3rd edition.

    Google Scholar 

  • Darroch, J.N., S.L. Lauritzen and T.P. Speed (1980). Markov fields and log-linear interaction models for contingency tables, The Annals of Statistics, vol. 8, pp. 522–539.

    Google Scholar 

  • Gordon, Jean, and Edward H. Shortliffe (1985). A method for managing evidential reasoning in hierarchical hypothesis spaces, Artificial Intelligence, vol. 26, pp 323–358.

    Google Scholar 

  • Griffeath, D. (1976). Introduction to random fields. In Kemeny, J.G., J.L. Snell, and A.W. Knapp (1976). Denumerable Markov Chains. Springer-Verlag, New York.

    Google Scholar 

  • Kong, Augustine (1986). Multivariate belief functions and graphical models, Doctoral dissertation, Department of Statistics, Harvard University, Cambridge MA 02138.

    Google Scholar 

  • Mellouli, Khaled (1987). On the combination of beliefs in networks using Dempster-Shafer's theory of evidence, Doctoral dissertation (in preparation), School of Business, University of Kansas, Lawrence, KS 66045-2003.

    Google Scholar 

  • Pearl, Judea (1986). Fusion, propagation, and structuring in Bayesian networks, Artificial intelligence, vol. 29, No. 3, pp. 241–288.

    Google Scholar 

  • Shafer, Glenn (1976). A Mathematical Theory of Evidence. Princeton University Press.

    Google Scholar 

  • Shafer, Glenn, and Roger Logan (1985). Implementing Dempster's rule for hierarchical evidence, Working paper No 174, School of Business, University of Kansas, Lawrence KS 66045-2003. To appear in Artificial Intelligence.

    Google Scholar 

  • Shafer, Glenn, Prakash P. Shenoy, and Khaled Mellouli (1986). Propagating belief functions in qualitative Markov trees, Working Paper No 186, School of Business, University of Kansas, Lawrence, KS 66045-2003. To appear in International Journal of Approximate Reasoning.

    Google Scholar 

  • Shenoy, Prakash P. and Glenn Shafer (1986). Propagating belief functions with local computations, IEEE Expert, vol. 1, No. 3, pp. 43–52.

    Google Scholar 

  • Shenoy, Prakash P., Glenn Shafer and Khaled Mellouli (1986). Propagation of belief functions: A Distributed Approach, in Proceedings of the Second AAAI Workshop on Uncertainty in Artificial Intelligence, Philadelphia, PA, pp. 249–260. To appear in J. Lemmer and L. Kanal, editors, (1987). Uncertainty in Artificial Intelligence. Vol. II, North-Holland, New York.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

B. Bouchon R. R. Yager

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mellouli, K., Shafer, G., Shenoy, P.P. (1987). Qualitative Markov networks. In: Bouchon, B., Yager, R.R. (eds) Uncertainty in Knowledge-Based Systems. IPMU 1986. Lecture Notes in Computer Science, vol 286. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18579-8_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-18579-8_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18579-6

  • Online ISBN: 978-3-540-48020-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics