Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
119 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On the Implementation of the Probabilistic Logic Programming Language ProbLog (1006.4442v1)

Published 23 Jun 2010 in cs.PL, cs.LG, and cs.LO

Abstract: The past few years have seen a surge of interest in the field of probabilistic logic learning and statistical relational learning. In this endeavor, many probabilistic logics have been developed. ProbLog is a recent probabilistic extension of Prolog motivated by the mining of large biological networks. In ProbLog, facts can be labeled with probabilities. These facts are treated as mutually independent random variables that indicate whether these facts belong to a randomly sampled program. Different kinds of queries can be posed to ProbLog programs. We introduce algorithms that allow the efficient execution of these queries, discuss their implementation on top of the YAP-Prolog system, and evaluate their performance in the context of large networks of biological entities.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (5)
  1. Angelika Kimmig (25 papers)
  2. Bart Demoen (7 papers)
  3. Luc De Raedt (55 papers)
  4. VĂ­tor Santos Costa (22 papers)
  5. Ricardo Rocha (20 papers)

Summary

We haven't generated a summary for this paper yet.