Computer Science – Programming Languages
Scientific paper
2011-12-16
Computer Science
Programming Languages
Online Proceedings of the 11th International Colloquium on Implementation of Constraint LOgic Programming Systems (CICLOPS 201
Scientific paper
When doing inference in ProbLog, a probabilistic extension of Prolog, we extend SLD resolution with some additional bookkeeping. This additional information is used to compute the probabilistic results for a probabilistic query. In Prolog's SLD, goals are nested very naturally. In ProbLog's SLD, nesting probabilistic queries interferes with the probabilistic bookkeeping. In order to support nested probabilistic inference we propose the notion of a parametrised ProbLog engine. Nesting becomes possible by suspending and resuming instances of ProbLog engines. With our approach we realise several extensions of ProbLog such as meta-calls, negation, and answers of probabilistic goals.
Janssens Gerda
Mantadelis Theofrastos
No associations
LandOfFree
Nesting Probabilistic 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 Nesting Probabilistic Inference, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Nesting Probabilistic Inference will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-136752