Abstract
An important feature of Qualitative Bayesian Networks is that they describe conditional independence models. However, they are not able to handle models involving logical constraints among the given variables. The aim of this paper is to show how this theory can be extended in such a way to represent also the logical constraints in the graph through an enhanced version of Qualitative Bayesian Networks. The relative algorithm for building these graphs (which is a generalization of the well-known algorithm based on D-separation criterion) is given.
This theory is particularly fit for conditional probabilistic independence models based on the notion of cs-independence. This notion avoids the usual critical situations shown by the classic definition when logical constraints are present.
This is a preview of subscription content, log in via an institution to check access.
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
Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, San Francisco (1988)
Coletti, G., Scozzafava, R.: The Role of Coherence in Eliciting and Handling Imprecise Probabilities and its Application to Medical Diagnosis. Information Sciences 130, 41–65 (2000)
Hill, J.R.: Comment on “Graphical models”. Statistical Science 8, 258–261 (1993)
Coletti, G., Scozzafava, R.: Zero Probabilities in Stochastical Independence. In: Bouchon-Meunier, B., Yager, R.R., Zadeh, L.A. (eds.) Information, Uncertainty, Fusion, pp. 185–196. Kluwer, Dordrecht (2000) (Selected papers from IPMU 1998)
Coletti, G., Scozzafava, R.: Stochastic Independence in a Coherent Setting. Annals of Mathematics and Artificial Intelligence 35, 151–176 (2002)
Coletti, G., Scozzafava, R.: Probabilistic logic in a coherent setting. Trends in logic n. 15. Kluwer, Dordrecht (2002)
Vantaggi, B.: The L-separation criterion for description of cs-independence models. International Journal of Approximate Reasoning 29, 291–316 (2002)
Vantaggi, B.: Graphical representation of asymmetric graphoid structures. Submitted to ISIPTA 2003, Lugano (2003)
Vantaggi, B.: Conditional Independence in a Coherent Finite Setting. Annals of Mathematic and Artificial Intelligence 32, 287–314 (2001)
Geiger, D., Verma, T., Pearl, J.: Identifying Independence in Bayesian Networks. Networks 20, 507–534 (1990)
de Finetti, B.: Sull’Impostazione Assiomatica del Calcolo delle Probabilità. Annali dell’Università di Trieste 19, 3–55 (1949);(Eng. transl.: Ch. 5 in Probability, Induction, Statistics. Wiley, London 1972)
Dawid, P.: Separoids: A mathematical framework for conditional independence and irrelevance. Annals of Mathematic and Artificial Intelligence 32, 335–372 (2001)
Krauss, P.H.: Representation of Conditional Probability Measures on Boolean Algebras. Acta Math. Acad. Sci. Hungar 19, 229–241 (1968)
Dubins, L.E.: Finitely Additive Conditional Probabilities, Conglomerability and Disintegration. Annals of Probability 3, 89–99 (1975)
Lauritzen, S.L.: Graphical Models. Clarendon Press, Oxford (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vantaggi, B. (2003). Qualitative Bayesian Networks with Logical Constraints. In: Nielsen, T.D., Zhang, N.L. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2003. Lecture Notes in Computer Science(), vol 2711. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45062-7_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-45062-7_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40494-1
Online ISBN: 978-3-540-45062-7
eBook Packages: Springer Book Archive