ProbLog Technology for Inference in a Probabilistic First Order Logic

@inproceedings{Bruynooghe2010ProbLogTF,
  title={ProbLog Technology for Inference in a Probabilistic First Order Logic},
  author={Maurice Bruynooghe and Theofrastos Mantadelis and Angelika Kimmig and Bernd Gutmann and Joost Vennekens and Gerda Janssens and Luc De Raedt},
  booktitle={ECAI},
  year={2010}
}
We introduce First Order ProbLog, an extension of first order logic with soft constraints where formulas are guarded by probabilistic facts. 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. 

Figures from this paper

Reasoning with Probabilistic Logics
TLDR
This paper illustrates the work done in this research field by presenting a probabilistic semantics for description logics and reasoning and learning algorithms, and presents in detail the system TRILL P, which computes the probability of queries w.r.t.
Tableau reasoning for description logics and its extension to probabilities
TLDR
TRLL and TRILLP can be used to compute the probability of queries to knowledge bases following DISPONTE semantics and experiments comparing these with other systems show the feasibility of the approach.
Probabilistic Hybrid Knowledge Bases Under the Distribution Semantics
TLDR
Probabilistic Hybrid Knowledge Bases PHKBs are proposed, where the atom in the head of LP clauses and each DL axiom is annotated with a probability value and the probability of a query being true is the sum of the probabilities of the deterministic KBs that entail the query.
Logic Programming Techniques for Reasoning with Probabilistic Ontologies
TLDR
TRLL for “Tableau Reasoner for descrIption Logics in proLog” is presented that implements a tableau algorithm and is able to return explanations for the queries and the corresponding probability, and TRILL for "TRILL powered by Pinpointing formulas" is presented, which can speed up the process of computing the probability.
Probabilistic inductive constraint logic
TLDR
This work considers the models produced by the inductive constraint logic system, represented by sets of integrity constraints, and proposes a probabilistic version of them, PASCAL, which achieves better or comparable results in terms of area under the precision–recall and receiver operating characteristic curves, in a comparable execution time.
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.
On Continuous Distributions and Parameter Estimation in Probabilistic Logic Programs (Over continue verdelingen en het schatten van parameters in probabilistische logische programma's)
TLDR
This thesis makes four main contributions to the field of probabilistic logic learning: hybrid ProbLog is an extension for ProbLog with continuous facts that allows for exact inference, Distributional Programs combine elements of ProbLog, Hybrid ProbLog and CP-Logic into a very expressive language for dealing with continuous distributions.
A probabilistic logic programming event calculus
TLDR
A system for recognising human activity given a symbolic representation of video content using a dialect of the Event Calculus and a state-of-the-art probabilistic logic programming framework is presented.
Modeling and Reasoning with ProbLog: An Application in Recognizing Complex Activities
TLDR
This paper proposes a simple and flexible ProbLog model, which is exploited to recognize complex ADLs in an online fashion and shows that the response time of ProbLog is satisfying for real-time applications.
Statistical Relational Learning
  • H. Blockeel
  • Computer Science
    Handbook on Neural Information Processing
  • 2013
TLDR
This chapter gives an overview of statistical relational learning, starting with some motivating problems, and continuing with a general description of the task of (statistical) relational learning and some of its more concrete forms.
...
1
2
...

References

SHOWING 1-10 OF 16 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.
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.
Probabilistic Logic
  • N. Nilsson
  • Philosophy, Computer Science
    Artif. Intell.
  • 1986
Probabilistic Logic Programming
TLDR
It is shown that deduction in the defined probabilistic logic pro grams is computationally more complex than deduction in classical logic programs, and a linear programming approach to deduction in probabilist logic programs is elaborate, which is efficient in interesting specia l cases.
Stochastic Logic Programs
TLDR
Stochastic logic programs are introduced as a means of providing a structured deenition of such a probability distribution and it is shown that the probabilities can be computed directly for fail-free logic programs and by normalisation for arbitrary logic programs.
A prolog technology theorem prover: Implementation by an extended prolog compiler
  • M. Stickel
  • Computer Science
    Journal of Automated Reasoning
  • 2004
A Prolog technology theorem prover (PTTP) is an extension of Prolog that is complete for the full first-order predicate calculus. It differs from Prolog in its use of unification with the occurs
Markov logic networks
TLDR
Experiments with a real-world database and knowledge base in a university domain illustrate the promise of this approach to combining first-order logic and probabilistic graphical models in a single representation.
The Independent Choice Logic and Beyond
  • D. Poole
  • Philosophy
    Probabilistic Inductive Logic Programming
  • 2008
TLDR
This paper gives an overview of the work done over the last decade and half, and points towards the considerable work ahead, particularly in the areas of lifted inference and the problems of existence and identity.
...
1
2
...