Inference in Probabilistic Logic Programs using Weighted CNF's

by   Daan Fierens, et al.

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.


page 1

page 2

page 3

page 4


Inference and learning in probabilistic logic programs using weighted Boolean formulas

Probabilistic logic programs are logic programs in which some of the fac...

MAP Inference for Probabilistic Logic Programming

In Probabilistic Logic Programming (PLP) the most commonly studied infer...

Generating Random Logic Programs Using Constraint Programming

Testing algorithms across a wide range of problem instances is crucial t...

Overcoming Misleads In Logic Programs by Redefining Negation

Negation as failure and incomplete information in logic programs have be...

Formula-Based Probabilistic Inference

Computing the probability of a formula given the probabilities or weight...

Please sign up or login with your details

Forgot password? Click here to reset