Inference and learning in probabilistic logic programs using weighted Boolean formulas
Top Cited Papers
- 15 April 2014
- journal article
- research article
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 15 (3) , 358-401
Abstract
Probabilistic logic programs are logic programs in which some of the facts are annotated with probabilities. This paper investigates how classical inference and learning tasks known from the graphical model community can be tackled for probabilistic logic programs. Several such tasks, such as computing the marginals, given evidence and learning from (partial) interpretations, have not really been addressed for probabilistic logic programs before. The first contribution of this paper is a suite of efficient algorithms for various inference tasks. It is based on the conversion of the program and the queries and evidence to a weighted Boolean formula. This allows us to reduce inference tasks to well-studied tasks, such as weighted model counting, which can be solved using state-of-the-art methods known from the graphical model and knowledge compilation literature. The second contribution is an algorithm for parameter estimation in the learning from interpretations setting. The algorithm employs expectation-maximization, and is built on top of the developed inference algorithms. The proposed approach is experimentally evaluated. The results show that the inference algorithms improve upon the state of the art in probabilistic logic programming, and that it is indeed possible to learn the parameters of a probabilistic logic program from interpretations.Keywords
All Related Versions
This publication has 19 references indexed in Scilit:
- Learning the Parameters of Probabilistic Logic Programs from Interpretations2011
- CP-logic: A language of causal probabilistic events and its relation to logic programmingTheory and Practice of Logic Programming, 2009
- The Independent Choice Logic and Beyond2008
- New Advances in Logic-Based Probabilistic Modeling by PRISM2008
- Compiling relational Bayesian networks for exact inferenceInternational Journal of Approximate Reasoning, 2006
- On transitive closure logic2005
- Logic programming revisitedACM Transactions on Computational Logic, 2001
- On the Tractable Counting of Theory Models and its Application to Truth Maintenance and Belief RevisionJournal of Applied Non-Classical Logics, 2001
- The well-founded semantics for general logic programsJournal of the ACM, 1991
- Graph minors. II. Algorithmic aspects of tree-widthJournal of Algorithms, 1986