Skip to main content

Credal and Bayesian Networks

  • Chapter
  • First Online:
Probabilistic Logics and Probabilistic Networks

Part of the book series: Synthese Library ((SYLI,volume 350))

Abstract

We have seen that in many cases it suffices to restrict attention to convex sets of probability functions, and even, in the case of objective Bayesianism, often a single probability function. This restriction will be important in what follows, since it will allow us to exploit the computational machinery of probabilistic networks—in particular credal networks and Bayesian networks —to help us answer the fundamental question.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 54.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abraham, J. A. (1979). An improved algorithm for network reliability. IEEE Transactions on Reliability, 28:58–61.

    Article  Google Scholar 

  2. Anrig, B. (2000). A generalization of the algorithm of Abraham. In Nikulin, M. and Limnios, N., editors, MMR’2000: Second International Conference on Mathematical Methods in Reliability, pages 95–98, Bordeaux, France.

    Google Scholar 

  3. Antonucci, A., Zaffalon, M., Ide, J. S., and Cozman, F. G. (2006). Binarization algorithms for approximate updating in credal nets. In Penserini, L., Peppas, P., and Perini, A., editors, STAIRS’06, 3rd European Starting AI Researcher Symposium, pages 120–131, Riva del Garda, Italy.

    Google Scholar 

  4. Cano, A., Fernández-Luna, J. M., and Moral, S. (2002). Computing probability intervals with simulated annealing and probability trees. Journal of Applied Non-Classical Logics, 12(2):151–171.

    Article  Google Scholar 

  5. Cozman, F. G. (2000). Credal networks. Artificial Intelligence, 120:199–233.

    Article  Google Scholar 

  6. da Rocha, J. C. F. and Cozman, F. G. (2003). Inference in credal networks with branch-and-bound algorithms. In Bernard, J. M., Seidenfeld, T., and Zaffalon, M., editors, ISIPTA’03, 3rd International Symposium on Imprecise Probabilities and Their Applications, pages 480–493, Lugano, Switzerland.

    Google Scholar 

  7. Darwiche, A. and Marquis, P. (2002). A knowledge compilation map. Journal of Artificial Intelligence Research, 17:229–264.

    Google Scholar 

  8. Kohlas, J. and Shenoy, P. P. (2000). Computation in valuation algebras. In Gabbay, D. M. and Smets, P., editors, Handbook of Defeasible Reasoning and Uncertainty Management Systems, volume 5: Algorithms for Uncertainty and Defeasible Reasoning, pages 5–39. Kluwer Academic Publishers, Dordrecht, Netherlands.

    Google Scholar 

  9. Lauritzen, S. and Spiegelhalter, D. J. (1988). Local computations with probabilities on graphical structures and their application to expert systems. Journal of the Royal Statistical Society, 50(2):157–224.

    Google Scholar 

  10. Russell, S. and Norvig, P. (2003). Artificial Intelligence: A Modern Approach. 2nd edition. Prentice Hall, Indiana, USA.

    Google Scholar 

  11. Shenoy, P. P. and Shafer, G. (1988). Axioms for probability and belief-function propagation. In Shachter, R. D., Levitt, T. S., Lemmer, J. F., and Kanal, L. N., editors, UAI’88, 4th Conference on Uncertainty in Artificial Intelligence, pages 169–198, Minneapolis, USA.

    Google Scholar 

  12. Wachter, M. and Haenni, R. (2007). Logical compilation of Bayesian networks with discrete variables. In Mellouli, K., editor, ECSQARU’07, 9th European Conference on Symbolic and Quantitative Approaches to Reasoning under Uncertainty, LNAI 4724, pages 536–547, Hammamet, Tunisia.

    Google Scholar 

  13. Wachter, M., Haenni, R., and Pouly, M. (2007). Optimizing inference in Bayesian networks and semiring valuation algebras. In Gelbukh, A. and Kuri Morales, A. F., editors, MICAI’07: 6th Mexican International Conference on Artificial Intelligence, LNAI 4827, pages 236–247, Aguascalientes, Mexico.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Rolf Haenni .

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer Science+Business Media B.V.

About this chapter

Cite this chapter

Haenni, R., Romeijn, JW., Wheeler, G., Williamson, J. (2011). Credal and Bayesian Networks. In: Probabilistic Logics and Probabilistic Networks. Synthese Library, vol 350. Springer, Dordrecht. https://doi.org/10.1007/978-94-007-0008-6_8

Download citation

Publish with us

Policies and ethics