10.4230/LIPICS.ICLP.2012.348
Sato, Taisuke
Taisuke
Sato
Meyer, Philipp
Philipp
Meyer
Tabling for infinite probability computation
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
2012
Article
probability
tabling
PRISM
Dovier, Agostino
Agostino
Dovier
Costa, Vítor Santos
Vítor Santos
Costa
2012
2012-09-05
2012-09-05
2012-09-05
en
urn:nbn:de:0030-drops-36355
10.4230/LIPIcs.ICLP.2012
978-3-939897-43-9
1868-8969
10.4230/LIPIcs.ICLP.2012
LIPIcs, Volume 17, ICLP 2012
Technical Communications of the 28th International Conference on Logic Programming (ICLP'12)
2013
17
32
348
358
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Dovier, Agostino
Agostino
Dovier
Costa, Vítor Santos
Vítor Santos
Costa
1868-8969
Leibniz International Proceedings in Informatics (LIPIcs)
2012
17
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
11 pages
497317 bytes
application/pdf
Creative Commons Attribution-NoDerivs 3.0 Unported license
info:eu-repo/semantics/openAccess
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.
LIPIcs, Vol. 17, Technical Communications of the 28th International Conference on Logic Programming (ICLP'12), pages 348-358