Computer Science – Logic in Computer Science
Scientific paper
2010-09-20
Proceedings of CICLOPS-WLPE 2010
Computer Science
Logic in Computer Science
Online proceedings of the Joint Workshop on Implementation of Constraint Logic Programming Systems and Logic-based Methods in
Scientific paper
Inference in probabilistic logic languages such as ProbLog, an extension of Prolog with probabilistic facts, is often based on a reduction to a propositional formula in DNF. Calculating the probability of such a formula involves the disjoint-sum-problem, which is computationally hard. In this work we introduce a new approximation method for ProbLog inference which exploits the DNF to focus sampling. While this DNF sampling technique has been applied to a variety of tasks before, to the best of our knowledge it has not been used for inference in probabilistic logic systems. The paper also presents an experimental comparison with another sampling based inference method previously introduced for ProbLog.
Janssens Gerda
Kimmig Angelika
Mantadelis Theofrastos
Shterionov Dimitar Sht.
No associations
LandOfFree
DNF Sampling for ProbLog Inference 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 DNF Sampling for ProbLog Inference, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and DNF Sampling for ProbLog Inference will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-264673