Inference in Probabilistic Logic Programs using Weighted CNF's
arXiv:1202.3719
Abstract
Probabilistic logic programs are logic programs in which some of the facts are annotated with probabilities. Several classical probabilistic inference tasks (such as MAP and computing marginals) have not yet received a lot of attention for this formalism. The contribution of this paper is that we develop efficient inference algorithms for these tasks. This is based on a conversion of the probabilistic logic program and the query and evidence to a weighted CNF formula. This allows us to reduce the inference tasks to well-studied tasks such as weighted model counting. To solve such tasks, we employ state-of-the-art methods. We consider multiple methods for the conversion of the programs as well as for inference on the weighted CNF. The resulting approach is evaluated experimentally and shown to improve upon the state-of-the-art in probabilistic logic programming.
Cited by in corpus (14)
- Scaling Exact Inference for Discrete Probabilistic Programs
- A Probabilistic Logic Programming Event Calculus
- Skolemization for Weighted First-Order Model Counting
- SPPL: Probabilistic Programming with Fast Exact Symbolic Inference
- Tractable Querying and Learning in Hybrid Domains via Sum-Product Networks
- Understanding the Complexity of Lifted Inference and Asymmetric Weighted Model Counting
- High-level Reasoning and Low-level Learning for Grasping: A Probabilistic Logic Pipeline
- Learning Probabilistic Logic Programs in Continuous Domains
- Algebraic Model Counting
- Canonical Decision Diagrams Modulo Theories
- flip-hoisting: Exploiting Repeated Parameters in Discrete Probabilistic Programs
- Abstracting Probabilistic Models: A Logical Perspective
- On the Role of Canonicity in Bottom-up Knowledge Compilation
- Semiring Programming: A Declarative Framework for Generalized Sum Product Problems