Author:
ISLAM MUHAMMAD ASIFUL,RAMAKRISHNAN C. R.,RAMAKRISHNAN I. V.
Abstract
AbstractProbabilistic Logic Programming (PLP), exemplified by Sato and Kameya's PRISM, Poole's ICL, Raedt et al.'s ProbLog and Vennekens et al.'s LPAD, is aimed at combining statistical and logical knowledge representation and inference. However, the inference techniques used in these works rely on enumerating sets of explanations for a query answer. Consequently, these languages permit very limited use of random variables with continuous distributions. In this paper, we present a symbolic inference procedure that uses constraints and represents sets of explanations without enumeration. This permits us to reason over PLPs with Gaussian or Gamma-distributed random variables (in addition to discrete-valued random variables) and linear equality constraints over reals. We develop the inference procedure in the context of PRISM; however the procedure's core ideas can be easily applied to other PLP languages as well. An interesting aspect of our inference procedure is that PRISM's query evaluation process becomes a special case in the absence of any continuous random variables in the program. The symbolic inference procedure enables us to reason over complex probabilistic models such as Kalman filters and a large subclass of Hybrid Bayesian networks that were hitherto not possible in PLP frameworks.
Publisher
Cambridge University Press (CUP)
Subject
Artificial Intelligence,Computational Theory and Mathematics,Hardware and Architecture,Theoretical Computer Science,Software
Reference33 articles.
1. Wang J. and Domingos P. 2008. Hybrid markov logic networks. In Proceedings of AAAI.
2. Singh A. , Ramakrishnan C. R. , Ramakrishnan I. V. , Warren D. and Wong J. 2008. A methodology for in-network evaluation of integrated logical-statistical models. In SenSys. 197–210.
3. Riguzzi F. and Swift T. 2010. Tabling and answer subsumption for reasoning on logic programs with annotated disjunctions. In Tech. Comm. of ICLP. 162–171.
4. Vennekens J. , Verbaeten S. and Bruynooghe M. 2004. Logic programs with annotated disjunctions. In ICLP. 431–445.
5. Raedt L. D. , Kimmig A. and Toivonen H. 2007. ProbLog: A probabilistic prolog and its application in link discovery. In IJCAI. 2462–2467.
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献