• Corpus ID: 14249836

Nesting Probabilistic Inference

@article{Mantadelis2011NestingPI,
  title={Nesting Probabilistic Inference},
  author={Theofrastos Mantadelis and Gerda Janssens},
  journal={ArXiv},
  year={2011},
  volume={abs/1112.3785}
}
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… 

Figures and Tables from this paper

Nesting Probabilistic Programs
TLDR
This work formalizes the notion of nesting probabilistic programming queries and introduces a new online nested Monte Carlo estimator that makes it substantially easier to ensure conditions required for convergence are met, thereby providing a simple framework for designing statistically correct inference engines.
Compacting Boolean Formulae for Inference in Probabilistic Logic Programming
TLDR
This work identifies 7 Boolean subformulae patterns that can be used to re-write Boolean formulae and implements an algorithm with polynomial complexity which detects and compacts 6 of these patterns, improving knowledge compilation and consecutively the overall inference performance.
Semantics and Contextual Equivalence for Probabilistic Programs with NestedQueries and Recursion
TLDR
This work gives formal semantics to a core PPL with continuous distributions, scoring, general recursion, and nested queries, and constructs a step-indexed, biorthogonal logical-relations model that establishes that logical relatedness implies contextual equivalence.
Tabular: Probabilistic Inference from the Spreadsheet
TLDR
The primary implementation is for Microsoft Excel and relies on Infer.NET for inference, but the language can be called independently of Excel and can target alternative inference engines.
Efficient Algorithms for Prolog Based Probabilistic Logic Programming (Efficiënte algoritmen voor prolog gebaseerd probabilistisch logisch programmeren)
TLDR
This thesis focuses on the extension and implementation of ProbLog, and presents several novel extensions to the ProbLog language, such as: general negation, probabilistic meta calls and ProbLog answers, as well as several novel algorithms that improve the performance of this task.
Probabilistic (logic) programming concepts
TLDR
A number of core programming concepts underlying the primitives used by various probabilistic languages are identified, the execution mechanisms that they require are discussed and these are used to position and survey state-of-the-art probabilism languages and their implementation.
Using MetaProbLog and ConArg to compute Probabilistic Argumentation Frameworks
TLDR
MetaProbLog is used, a ProbLog framework where facts in a logic program are annotated by probabilities, to compute the probability of possible worlds of arguments in Probabilistic Abstract Argumentation.
Probabilistic Argumentation Frameworks with MetaProbLog and ConArg
TLDR
MetaProbLog is used, a ProbLog framework where facts in a logic program are annotated by probabilities, to compute the probability of possible worlds of arguments in Probabilistic Abstract Argumentation.
Probabilistic Programming Concepts
TLDR
A number of core programming concepts underlying the primitives used by various probabilistic languages are identified, the execution mechanisms that they require are discussed and these are used to position state-of-the-art probabilism languages and their implementation.
MetaBayes: Bayesian Meta-Interpretative Learning Using Higher-Order Stochastic Refinement
TLDR
This paper shows how Meta-Interpretive Learning (MIL) can be extended to implement a Bayesian posterior distribution over the hypothesis space by treating the meta-interpreter as a Stochastic Logic Program.
...
1
2
...

References

SHOWING 1-10 OF 10 REFERENCES
Trading memory for answers: Towards tabling ProbLog
TLDR
Extensions of exact inference to deal with negated ground subgoals in clause bodies are discussed that broaden the class of problems that can be handled and can speed up inference in domains where dierent proofs of a query share manySubgoals.
Dedicated Tabling for a Probabilistic Setting
TLDR
By avoiding repeated subcomputations, the tabling approach not only improves the execution time of ProbLog programs, but also decreases accordingly the memory consumption.
Tabling relevant parts of SLD proofs for ground goals in a probabilistic setting
TLDR
This work investigates how the idea of tabling can be used in ProbLog: the challenge is that only the relevant probabilistic parts of the SLD proof tree are required, and outlines a direction to tabling ProbLog programs.
On the Efficient Execution of ProbLog Programs
TLDR
Algorithms that allow the efficient execution of queries are introduced, their implementation on top of the YAP-Prolog system is discussed, and their performance in the context of large networks of biological entities is evaluated.
Tabling and Answer Subsumption for Reasoning on Logic Programs with Annotated Disjunctions
TLDR
PITA is based on a program transformation techniques that adds an extra argument to every atom for computing the probability of queries from Logic Programs with Annotated Disjunctions and is faster than competing algorithms.
Probabilistic Horn Abduction and Bayesian Networks
  • D. Poole
  • Computer Science
    Artif. Intell.
  • 1993
Parameter Learning of Logic Programs for Symbolic-Statistical Modeling
TLDR
A logical/mathematical framework for statistical parameter learning of parameterized logic programs, i.e. definite clause programs containing probabilistic facts with a parameterized distribution, and a new EM algorithm that can significantly outperform the Inside-Outside algorithm.
The Complexity of Enumeration and Reliability Problems
  • L. Valiant
  • Mathematics, Computer Science
    SIAM J. Comput.
  • 1979
TLDR
For a large number of natural counting problems for which there was no previous indication of intractability, that they belong to the class of computationally eqivalent counting problems that are at least as difficult as the NP-complete problems.
YAP user''s manual
In an isotope-separation process, using polyatomic molecules having a complicated absorption spectrum such that the isotope shifts are masked, a plurality of laser pulses are used to irradiate a