On the Efficient Execution of ProbLog Programs

The past few years have seen a surge of interest in the field of probabilistic logic learning or 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 mutually independent probabilities that they 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.

[1]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[2]  J. W. Lloyd,et al.  Foundations of logic programming; (2nd extended ed.) , 1987 .

[3]  John Wylie Lloyd,et al.  Foundations of Logic Programming , 1987, Symbolic Computation.

[4]  Krzysztof R. Apt,et al.  Logic Programming , 1990, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[5]  Evgeny Dantsin,et al.  Probabilistic Logic Programs and their Semantics , 1990, RCLP.

[6]  David Poole,et al.  Probabilistic Horn Abduction and Bayesian Networks , 1993, Artif. Intell..

[7]  Taisuke Sato,et al.  A Statistical Learning Method for Logic Programs with Distribution Semantics , 1995, ICLP.

[8]  S. Muggleton.  Stochastic Logic Programs , 1996 .

[9]  Laks V. S. Lakshmanan,et al.  ProbView: a flexible probabilistic database system , 1997, TODS.

[10]  Norbert Fuhr.  Probabilistic Datalog: implementing logical information retrieval for advanced applications , 2000 .

[11]  David Poole,et al.  Abducing through negation as failure: stable models within the independent choice logic , 2000, J. Log. Program..

[12]  Yoshitaka Kameya,et al.  Parameter Learning of Logic Programs for Symbolic-Statistical Modeling , 2001, J. Artif. Intell. Res..

[13]  Maurice Bruynooghe,et al.  Logic programs with annotated disjunctions , 2004, NMR.

[14]  Jennifer Widom,et al.  Trio: A System for Integrated Management of Data, Accuracy, and Lineage , 2004, CIDR.

[15]  Hannu Toivonen,et al.  Link Discovery in Graphs Derived from Biological Databases , 2006, DILS.

[16]  Dan Suciu,et al.  Efficient query evaluation on probabilistic databases , 2004, The VLDB Journal.

[17]  Roberto Basili,et al.  AI*IA 2007: Artificial Intelligence and Human-Oriented Computing, 10th Congress of the Italian Association for Artificial Intelligence, Rome, Italy, September 10-13, 2007, Proceedings , 2007, AI*IA.

[18]  Luc De Raedt,et al.  Compressing probabilistic Prolog programs , 2007, Machine Learning.

[19]  Luc De Raedt,et al.  ProbLog: A Probabilistic Prolog and its Application in Link Discovery , 2007, IJCAI.

[20]  Fabrizio Riguzzi,et al.  A Top Down Interpreter for LPAD and CP-Logic , 2007, AI*IA.

[21]  Joost N. Kok.  Machine Learning: ECML 2007, 18th European Conference on Machine Learning, Warsaw, Poland, September 17-21, 2007, Proceedings , 2007, ECML.

[22]  Luc De Raedt,et al.  Probabilistic Explanation Based Learning , 2007, ECML.

[23]  Luc De Raedt,et al.  Probabilistic local pattern mining , 2008 .

[24]  Luc De Raedt,et al.  Parameter Learning in Probabilistic Databases: A Least Squares Approach , 2008, ECML/PKDD.

[25]  James Cussens,et al.  CLP(BN): Constraint Logic Programming for Probabilistic Knowledge , 2002, Probabilistic Inductive Logic Programming.

[26]  Peter A. Flach,et al.  Evaluation Measures for Multi-class Subgroup Discovery , 2009, ECML/PKDD.

[27]  David Poole,et al.  Logic programming, abduction and probability , 1993, New Generation Computing.