2007 ProbLogAProbabilisticPrologandI

• (De Raedt et al., 2007) ⇒ Luc De Raedt, Angelika Kimmig, and Hannu Toivonen. (2007). “ProbLog: A Probabilistic Prolog and Its Application in Link Discovery.” In: Proceedings of the 20th international joint conference on Artifical intelligence.

Subject Headings: Probabilistic Logic.

Cited By

• http://scholar.google.com/scholar?q=%222007%22+ProbLog%3A+A+Probabilistic+Prolog+and+Its+Application+in+Link+Discovery
• http://dl.acm.org/citation.cfm?id=1625275.1625673&preflayout=flat#citedby

Quotes

Abstract

We introduce ProbLog, a probabilistic extension of Prolog. A ProbLog program defines a distribution over logic programs by specifying for each clause the probability that it belongs to a randomly sampled program, and these probabilities are mutually independent. The semantics of ProbLog is then defined by the success probability of a query, which corresponds to the probability that the query succeeds in a randomly sampled program. The key contribution of this paper is the introduction of an effective solver for computing success probabilities. It essentially combines SLD-resolution with methods for computing the probability of Boolean formulae. Our implementation further employs an approximation algorithm that combines iterative deepening with binary decision diagrams. We report on experiments in the context of discovering links in real biological networks, a demonstration of the practical usefulness of the approach.

References

;

	Author	volume	Date Value	title	type	journal	titleUrl	doi	note	year
2007 ProbLogAProbabilisticPrologandI	Luc De Raedt Hannu Toivonen Angelika Kimmig			ProbLog: A Probabilistic Prolog and Its Application in Link Discovery						2007