When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICLP.2012.348
URN: urn:nbn:de:0030-drops-36355
Go to the corresponding LIPIcs Volume Portal

Sato, Taisuke ; Meyer, Philipp

Tabling for infinite probability computation

33.pdf (0.5 MB)


Tabling in logic programming has been used to eliminate redundant computation and also to stop infinite loop. In this paper we add the third usage of tabling, i.e. to make infinite computation possible for probabilistic logic programs. Using PRISM, a logic-based probabilistic modeling language with a tabling mechanism, we generalize prefix probability computation for PCFGs to probabilistic logic programs. Given a top-goal, we search for all SLD proofs by tabled search regardless of whether they contain loop or not. We then convert them to a set of linear probability equations and solve them by matrix operation. The solution gives us the probability of the top-goal, which, in nature, is an infinite sum of probabilities. Our generalized approach to prefix probability computation through tabling opens a way to logic-based probabilistic modeling of cyclic dependencies.

BibTeX - Entry

  author =	{Taisuke Sato and Philipp Meyer},
  title =	{{Tabling for infinite probability computation}},
  booktitle =	{Technical Communications of the 28th International Conference on Logic Programming (ICLP'12)},
  pages =	{348--358},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-43-9},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{17},
  editor =	{Agostino Dovier and V{\'i}tor Santos Costa},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{},
  URN =		{urn:nbn:de:0030-drops-36355},
  doi =		{10.4230/LIPIcs.ICLP.2012.348},
  annote =	{Keywords: probability, tabling, PRISM}

Keywords: probability, tabling, PRISM
Seminar: Technical Communications of the 28th International Conference on Logic Programming (ICLP'12)
Issue Date: 2012
Date of publication: 27.07.2012

DROPS-Home | Fulltext Search | Imprint Published by LZI