Trading Memory for Answers: Towards Tabling ProbLog
Angelika Kimmig, Bernd Gutmann and VĂtor Santos Costa
2009
Abstract
ProbLog is a recent probabilistic extension of Prolog, where facts can
be labeled with mutually independent probabilities that they belong to
a randomly sampled program. The implementation of ProbLog on top of
the YAP-Prolog system provides various inference algorithms that
calculate the success probability of a query, i.e. the probability
that the query is provable in a randomly sampled program. We discuss
extensions of these algorithms with tabling that broaden the class of
problems that can be handled. First, exploiting structure sharing can
speed up inference in domains where different proofs of a query share
many subgoals. Second, we extend exact inference to deal with negated
ground subgoals in clause bodies.
Bibtex
@InProceedings{kimmig-srl09,
author = {A. Kimmig and B. Gutmann and V. Santos Costa},
title = {{Trading Memory for Answers: Towards Tabling ProbLog}},
booktitle = {Proceedings of the International Workshop on Statistical Relational Learning (SRL 2009)},
editor = {P. Domingos and K. Kersting},
month = {July},
year = {2009},
address = {Leuven, Belgium},
}
Download Paper
PDF file