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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abraham, J. A. (1979). An improved algorithm for network reliability. IEEE Transactions on Reliability, 28:58–61.
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.
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.
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.
Cozman, F. G. (2000). Credal networks. Artificial Intelligence, 120:199–233.
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.
Darwiche, A. and Marquis, P. (2002). A knowledge compilation map. Journal of Artificial Intelligence Research, 17:229–264.
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.
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.
Russell, S. and Norvig, P. (2003). Artificial Intelligence: A Modern Approach. 2nd edition. Prentice Hall, Indiana, USA.
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.
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.
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.
Author information
Authors and Affiliations
Corresponding author
Rights 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
DOI: https://doi.org/10.1007/978-94-007-0008-6_8
Published:
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-007-0007-9
Online ISBN: 978-94-007-0008-6
eBook Packages: Humanities, Social Sciences and LawPhilosophy and Religion (R0)