Computer Science – Artificial Intelligence
Scientific paper
2012-02-14
Computer Science
Artificial Intelligence
Scientific paper
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.
den Broeck Guy Van
Fierens Daan
Gutmann Bernd
Raedt Luc de
Thon Ingo
No associations
LandOfFree
Inference in Probabilistic Logic Programs using Weighted CNF's does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Inference in Probabilistic Logic Programs using Weighted CNF's, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Inference in Probabilistic Logic Programs using Weighted CNF's will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-90427