Sato, Taisuke ;
Meyer, Philipp
Tabling for infinite probability computation
Abstract
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 logicbased probabilistic modeling language with a tabling mechanism, we generalize prefix probability computation for PCFGs to probabilistic logic programs. Given a topgoal, 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 topgoal, which, in nature, is an infinite sum of probabilities. Our generalized approach to prefix probability computation through tabling opens a way to logicbased probabilistic modeling of cyclic dependencies.
BibTeX  Entry
@InProceedings{sato_et_al:LIPIcs:2012:3635,
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 = {348358},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {9783939897439},
ISSN = {18688969},
year = {2012},
volume = {17},
editor = {Agostino Dovier and V{\'i}tor Santos Costa},
publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2012/3635},
URN = {urn:nbn:de:0030drops36355},
doi = {http://dx.doi.org/10.4230/LIPIcs.ICLP.2012.348},
annote = {Keywords: probability, tabling, PRISM}
}
2012
Keywords: 

probability, tabling, PRISM 
Seminar: 

Technical Communications of the 28th International Conference on Logic Programming (ICLP'12)

Related Scholarly Article: 


Issue date: 

2012 
Date of publication: 

2012 