Probabilistic Logic with Conditional Independence Formulae

Authors:
Magdalena Ivanovska;Martin Giese
Affiliations:
Department of Informatics, University of Oslo, Norway;Department of Informatics, University of Oslo, Norway
Venue:
Proceedings of the 2010 conference on STAIRS 2010: Proceedings of the Fifth Starting AI Researchers' Symposium
Year:
2010

Citing 6
Cited 0

A logic for reasoning about probabilities

Information and Computation - Selections from 1988 IEEE symposium on logic in computer science
Bayesian logic

Decision Support Systems - Special issue on logic modeling
Credal networks

Artificial Intelligence
Reasoning about Uncertainty

Reasoning about Uncertainty
Learning Bayesian Networks

Learning Bayesian Networks
Probabilistic logic with independence

International Journal of Approximate Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate probabilistic propositional logic as a way of expressing and reasoning about uncertainty. In contrast to Bayesian networks, a logical approach can easily cope with incomplete information like probabilities that are missing or only known to lie in some interval. However, probabilistic propositional logic as described e.g. by Halpern [1], has no way of expressing conditional independence, which is important for compact specification in many cases. We define a logic with conditional independence formulae. We give an axiomatization which we show to be complete for the kind of inferences allowed by Bayesian networks, while still being suitable for reasoning under incomplete information.