Document Open Access Logo

Dedicated Tabling for a Probabilistic Setting

Authors Theofrastos Mantadelis, Gerda Janssens



PDF
Thumbnail PDF

File

LIPIcs.ICLP.2010.124.pdf
  • Filesize: 0.6 MB
  • 10 pages

Document Identifiers

Author Details

Theofrastos Mantadelis
Gerda Janssens

Cite AsGet BibTex

Theofrastos Mantadelis and Gerda Janssens. Dedicated Tabling for a Probabilistic Setting. In Technical Communications of the 26th International Conference on Logic Programming. Leibniz International Proceedings in Informatics (LIPIcs), Volume 7, pp. 124-133, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2010)
https://doi.org/10.4230/LIPIcs.ICLP.2010.124

Abstract

ProbLog is a probabilistic framework that extends Prolog with probabilistic facts. To compute the probability of a query, the complete SLD proof tree of the query is collected as a sum of products. ProbLog applies advanced techniques to make this feasible and to assess the correct probability. Tabling is a well-known technique to avoid repeated subcomputations and to terminate loops. We investigate how tabling can be used in ProbLog. The challenge is that we have to reconcile tabling with the advanced ProbLog techniques. While standard tabling collects only the answers for the calls, we do need the SLD proof tree. Finally we discuss how to deal with loops in our probabilistic framework. By avoiding repeated subcomputations, our tabling approach not only improves the execution time of ProbLog programs, but also decreases accordingly the memory consumption. We obtain promising results for ProbLog programs using exact probability inference.
Keywords
  • Tabling
  • Loop Detection
  • Probabilistic Logical Programming
  • ProbLog

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail