On the Efficient Execution of ProbLog Programs

  • Authors:
  • Angelika Kimmig;Vítor Santos Costa;Ricardo Rocha;Bart Demoen;Luc Raedt

  • Affiliations:
  • Departement Computerwetenschappen, K.U. Leuven, Heverlee, Belgium B-3001;CRACS & Faculdade de Ciêências, Universidade do Porto, Portugal, Porto, Portugal 4169-007;CRACS & Faculdade de Ciêências, Universidade do Porto, Portugal, Porto, Portugal 4169-007;Departement Computerwetenschappen, K.U. Leuven, Heverlee, Belgium B-3001;Departement Computerwetenschappen, K.U. Leuven, Heverlee, Belgium B-3001

  • Venue:
  • ICLP '08 Proceedings of the 24th International Conference on Logic Programming
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

The past few years have seen a surge of interest in the field of probabilistic logic learning or statistical relational learning. In this endeavor, many probabilistic logics have been developed. ProbLog is a recent probabilistic extension of Prolog motivated by the mining of large biological networks. In ProbLog, facts can be labeled with mutually independent probabilities that they belong to a randomly sampled program. Different kinds of queries can be posed to ProbLog programs. We introduce algorithms that allow the efficient execution of these queries, discuss their implementation on top of the YAP-Prolog system, and evaluate their performance in the context of large networks of biological entities.