• Corpus ID: 62919189

Tabling relevant parts of SLD proofs for ground goals in a probabilistic setting

  title={Tabling relevant parts of SLD proofs for ground goals in a probabilistic setting},
  author={Theofrastos Mantadelis and Gerda Janssens},
ProbLog is a probabilistic framework that extends Prolog with probabilistic facts. Inference in ProbLog is based on calculations over the SLD proof tree of a query. Tabling is a well known technique to avoid re-computation. We investigate how the idea of tabling can be used in ProbLog: the challenge is that we are not just interested in the answers of a query but in retaining the SLD proof tree. Luckily, only the relevant probabilistic parts of the SLD proof tree are required. Tabling not only… 
Dedicated Tabling for a Probabilistic Setting
By avoiding repeated subcomputations, the tabling approach not only improves the execution time of ProbLog programs, but also decreases accordingly the memory consumption.
Nesting Probabilistic Inference
In order to support nested probabilistic inference in ProbLog, the notion of a parametrised ProbLog engine is proposed and several extensions of ProbLog such as meta-calls, negation, and answers of probabilism goals are realised.
DNF Sampling for ProbLog Inference
A new approximation method for ProbLog inference which exploits the DNF to focus sampling, which is based on a reduction to a propositional formula in DNF.
Tabling and Answer Subsumption for Reasoning on Logic Programs with Annotated Disjunctions
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.
ProbLog Technology for Inference in a Probabilistic First Order Logic
The paper defines a semantics for FOProbLog, develops a translation into ProbLog, a system that allows a user to compute the probability of a query in a similar setting restricted to Horn clauses, and reports on initial experience with inference.
On the implementation of the probabilistic logic programming language ProbLog
Algorithms that allow the efficient execution of queries in ProbLog 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.
Efficient Algorithms for Prolog Based Probabilistic Logic Programming (Efficiënte algoritmen voor prolog gebaseerd probabilistisch logisch programmeren)
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.
Inference and Learning for Directed Probabilistic Logic Models (Inferentie en leren voor gerichte probabilistische logische modellen)
This dissertation focuses on directed probabilistic logic models and more specifically on CP-logic, and contributes two methods to improve the efficiency of inference and one method for learning.
CP-Logic Theory Inference with Contextual Variable Elimination and Comparison to BDD Based Inference Methods
This paper investigates inference algorithms for Causal probabilistic logic and proposes a new CP-logic inference method based on contextual variable elimination, which is compared to variable elimination and to methods based on binary decision diagrams.


ProbLog: A Probabilistic Prolog and its Application in Link Discovery
The key contribution of this paper is the introduction of an effective solver for computing success probabilities, which essentially combines SLD-resolution with methods for computing the probability of Boolean formulae.
Linear tabling strategies and optimizations
This article describes two strategies of linear tabling, namely, lazy and eager strategies, and compares them both qualitatively and quantitatively, and indicates that, while the lazy strategy has good locality and is well suited for finding all solutions, the eager strategy is comparable in speed with the lazy Strategy and isWell suited for programs with cuts.
Compressing probabilistic Prolog programs
The theory compression task for ProbLog is introduced, which consists of selecting that subset of clauses of a given ProbLog program that maximizes the likelihood w.r.t. a set of positive and negative examples.
Beyond Depth-First Strategies: Improving Tabled Logic Programs through Alternative Scheduling
This paper investigates alternate scheduling strategies for tabling in a WAM implementation, the SLG-WAM, and proposes a more sophisticated scheduling strategy, batched scheduling, which reduces the overheads of these operations and provides dramatic space reduction as well as speedups for many programs.
A Space Efficient Engine for Subsumption-Based Tabled Evaluation of Logic Programs
Time-Stamped Trie (TST) is presented, a alternative data structure for organizing answer tables in subsumption-based tabling that relaxes the retrieval order, and yet ensures that all answers will be eventually retrieved.
Speculative Beats Conservative Justification
This paper introduces the concept of a speculative justifier, a justifier that select literals that can possibly provide evidence for the goal's truth, assume that their truth values correspond to thegoal's and proceed to build a justification for each of them.
Tabled evaluation with delaying for general logic programs
This work addresses all three problems for goal-oriented query evaluation of general logic programs by presenting tabled evaluation with delaying, called SLG resolution, which has three distinctive features: it has a polynomial time data complexity for well-founded negation of function-free programs.
On the Efficient Execution of ProbLog Programs
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.
XSB: A System for Effciently Computing WFS
The well-founded model provides a natural and robust semantics for logic programs with negative literals in rule bodies in the SLG-WAM of XSB, a full Prolog system that closely approximates the ISO standard.
OLD Resolution with Tabulation
To resolve the search-incompleteness of depth-first logic program interpreters, a new interpretation method based on the tabulation technique is developed and modeled as a refinement to SLD