Probabilistic Logic with Conditional Independence Formulae

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 [9], 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.

• Type: Conference
• Year: 2010
• Where: ECAI
• Authors: Magdalena Ivanovska, Martin Giese
• Keywords: Artificial Intelligence, Bayesian Networks, Conditional Independence, ECAI 2010, Probabilistic Propositional Logic