Compressing Probabilistic Prolog Programs
Abstract
ProbLog is a recently introduced probabilistic extension of Prolog (De Raedt, et al. in Proceedings of the 20th international joint conference on artificial intelligence, pp. 2468–2473, 2007 ). 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 in a randomly sampled program. This paper introduces the theory compression task for ProbLog, 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. Experiments in the context of discovering links in real biological networks demonstrate the practical applicability of the approach.
Cite
Text
De Raedt et al. "Compressing Probabilistic Prolog Programs." Machine Learning, 2008. doi:10.1007/S10994-007-5030-XMarkdown
[De Raedt et al. "Compressing Probabilistic Prolog Programs." Machine Learning, 2008.](https://mlanthology.org/mlj/2008/raedt2008mlj-compressing/) doi:10.1007/S10994-007-5030-XBibTeX
@article{raedt2008mlj-compressing,
title = {{Compressing Probabilistic Prolog Programs}},
author = {De Raedt, Luc and Kersting, Kristian and Kimmig, Angelika and Revoredo, Kate and Toivonen, Hannu},
journal = {Machine Learning},
year = {2008},
pages = {151-168},
doi = {10.1007/S10994-007-5030-X},
volume = {70},
url = {https://mlanthology.org/mlj/2008/raedt2008mlj-compressing/}
}