2026-07-22T18:09:53Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:3635 2024-03-06T10:34:28Z ddc:004 open_access

Tabling for infinite probability computation Sato, Taisuke Meyer, Philipp probability tabling PRISM 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Taisuke Sato and Philipp Meyer 2012 Is Part Of LIPIcs, Volume 17, Technical Communications of the 28th International Conference on Logic Programming (ICLP'12) (2012) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ICLP.2012.348 urn:nbn:de:0030-drops-36355 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2012.348 eng https://creativecommons.org/licenses/by-nd/3.0/legalcode