Author:
NAMPALLY ARUN,ZHANG TIMOTHY,RAMAKRISHNAN C. R.
Abstract
AbstractProbabilistic Logic Programs (PLPs) generalize traditional logic programs and allow the encoding of models combining logical structure and uncertainty. In PLP, inference is performed by summarizing the possible worlds which entail the query in a suitable data structure, and using this data structure to compute the answer probability. Systems such as ProbLog, PITA, etc., use propositional data structures like explanation graphs, BDDs, SDDs, etc., to represent the possible worlds. While this approach saves inference time due to substructure sharing, there are a number of problems where a more compact data structure is possible. We propose a data structure called Ordered Symbolic Derivation Diagram (OSDD) which captures the possible worlds by means of constraint formulas. We describe a program transformation technique to construct OSDDs via query evaluation, and give procedures to perform exact and approximate inference over OSDDs. Our approach has two key properties. Firstly, the exact inference procedure is a generalization of traditional inference, and results in speedup over the latter in certain settings. Secondly, the approximate technique is a generalization of likelihood weighting in Bayesian Networks, and allows us to perform sampling-based inference with lower rejection rate and variance. We evaluate the effectiveness of the proposed techniques through experiments on several problems.
Publisher
Cambridge University Press (CUP)
Subject
Artificial Intelligence,Computational Theory and Mathematics,Hardware and Architecture,Theoretical Computer Science,Software
Reference31 articles.
1. Mansinghka V. , Roy D. , Jonas E. , and Tenenbaum J. 2009. Exact and approximate sampling by systematic stochastic search. In 12th International Conference on Artificial Intelligence and Statistics. 400–407.
2. Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
3. den Broeck G. V. , Taghipour N. , Meert W. , Davis J. , and Raedt L. D. 2011. Lifted probabilistic inference by first-order knowledge compilation. In 20th International Joint Conference on Artificial Intelligence. 2178–2185.
4. Lifted Variable Elimination for Probabilistic Logic Programming
5. Holzbaur C. 1992. Metastructures versus attributed variables in the context of extensible unification. In 4th International Symposium on Programming Language Implementation and Logic Programming. 260–268.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献