PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

ProbLog: a probabilistic Prolog and its application in link discovery
Luc De Raedt, Angelika Kimmig and Hannu Toivonen
In: Twentieth International Joint Conference on Artificial Intelligence (IJCAI-07), Jan 2007, Hyderabad, India.


We introduce ProbLog, a probabilistic extension of Prolog. A ProbLog program defines a distribution over logic programs by specifying for each clause the probability that it belongs to a randomly sampled program, and these probabilities are mutually independent. The semantics of ProbLog is then defined by the success probability of a query, which corresponds to the probability that the query succeeds in a randomly sampled program. The key contribution of this paper is the introduction of an effective solver for computing success probabilities. It essentially combines SLD-resolution with methods for computing the probability of Boolean formulae. Our implementation further employs an approximation algorithm that combines iterative deepening with binary decision diagrams. We report on experiments in the context of discovering links in real biological networks, a demonstration of the practical usefulness of the approach.

PDF - Requires Adobe Acrobat Reader or other PDF viewer.
EPrint Type:Conference or Workshop Item (Paper)
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Theory & Algorithms
ID Code:5923
Deposited By:Hannu Toivonen
Deposited On:08 March 2010