| Home > Publications > Reports > Informatics (CW) |
CW 368
Joost Vennekens and Sofie Verbaeten
Logic Progams with Annotated Disjunctions
Abstract
Current literature offers a number of different approaches to what could generally be called ``probabilistic logic programming''. These are usually based on Horn clauses. In this work, we introduce a new formalism, Logic Programs with Annotated Disjunctions, based on disjunctive logic programs. Each of the clauses in this formalism represents a single experiment, of which the disjuncts in its head are the possible results. Because of this, each of these disjuncts is annotated with a probability. Viewing such a set of probabilistic disjunctive clauses as a probabilistic disjunction of normal logic programs allows us to derive a possible world semantics for our formalism, which is consistent with the work of Halpern.
We show how a hidden Markov model and Bayesian network can be modeled in this formalism and demonstrate how it can be used to represent uncertainty in an event calculus setting. We also relate our formalism to existing work. More specifically, we offer a detailed comparison with the Indedepent Choice Logic by D. Poole, Bayesian Logic Programming by K. Kersting and L. De Raedt and Stochastic Logic Programs by J. Cussens and S. Muggleton.
report.pdf / mailto: J. Vennekens