Skip to main content
    • Aa
    • Aa

Structure learning of probabilistic logic programs by searching the clause space


Learning probabilistic logic programming languages is receiving an increasing attention, and systems are available for learning the parameters (PRISM, LeProbLog, LFI-ProbLog and EMBLEM) or both structure and parameters (SEM-CP-logic and SLIPCASE) of these languages. In this paper we present the algorithm SLIPCOVER for “Structure LearnIng of Probabilistic logic programs by searChing OVER the clause space.” It performs a beam search in the space of probabilistic clauses and a greedy search in the space of theories using the log likelihood of the data as the guiding heuristics. To estimate the log likelihood, SLIPCOVER performs Expectation Maximization with EMBLEM. The algorithm has been tested on five real world datasets and compared with SLIPCASE, SEM-CP-logic, Aleph and two algorithms for learning Markov Logic Networks (Learning using Structural Motifs (LSM) and ALEPH++ExactL1). SLIPCOVER achieves higher areas under the precision-recall and receiver operating characteristic curves in most cases.

Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

N. Beerenwinkel , J. Rahnenführer , M. Däumer , D. Hoffmann , R. Kaiser , J. Selbig and T. Lengauer 2005. Learning multiple evolutionary pathways from cross-sectional data. Journal of Computational Biology 12, 584598.

M. Biba , S. Ferilli and F. Esposito 2008. Discriminative structure learning of Markov logic networks. In Proceedings of the 18th International Conference on Inductive Logic Programming (ILP-2008). LNCS, Vol. 5194. Springer, Berlin, Germany, 5976.

S. Bragaglia and F. Riguzzi 2011. Approximate inference for logic programs with annotated disjunctions. In 20th International Conference on Inductive Logic Programming (ILP-2010), Revised Papers. LNCS, Vol. 6489. Springer, Berlin, Germany, 3037.

M. Craven and S. Slattery 2001. Relational learning with statistical predicate invention: Better models for hypertext. Machine Learning 43, 97119.

J. Davis and M. Goadrich 2006. The relationship between precision-recall and ROC curves. In Proceedings of the 23rd International Conference on Machine Learning (ICML-2006). ACM International Conference Proceeding Series 148. ACM, New York, NY, 233240.

L. De Raedt , K. Kersting , A. Kimmig , K. Revoredo and H. Toivonen 2008. Compressing probabilistic Prolog programs. Machine Learning 70, 151168.

T. Fawcett 2006. An introduction to ROC analysis. Pattern Recognition Letters 27, 861874.

N. Fuhr 2000. Probabilistic datalog: Implementing logical information retrieval for advanced applications. Journal of the American Society for Information Science 51, 95110.

B. Gutmann , A. Kimmig , K. Kersting and L. De Raedt 2008. Parameter learning in probabilistic databases: A least squares approach. In Machine Learning and Knowledge Discovery in Databases – European Conference (ECML/PKDD-2008), Proceedings, Part I, LNCS, Vol. 5211. Springer, Berlin, Germany, 473488.

T. N. Huynh and R. J. Mooney 2008. Discriminative structure and parameter learning for Markov logic networks. In Proceedings of the 25th International Conference on Machine Learning (ICML-2008), ACM International Conference Proceeding Series 307. ACM, New York, NY, 416423.

K. Kersting and L. De Raedt 2008. Basic principles of learning Bayesian logic programs. In Probabilistic Inductive Logic Programming, L. De Raedt , P. Frasconi , K. Kersting and S. Muggleton , Eds. LNCS, Vol. 4911. Springer, New York, NY, 189221.

H. Khosravi , O. Schulte , J. Hu and T. Gao 2012. Learning compact Markov logic networks with decision trees. Machine Learning 89, 257277.

S. Kok and P. Domingos 2005. Learning the structure of Markov logic networks. In Proceedings of the 22nd International Conference on Machine Learning (ICML-2005), ACM International Conference Proceeding Series 119. ACM, New York, NY, 441448.

L. Mihalkova and R. J. Mooney 2007. Bottom-up learning of Markov logic network structure. In Proceedings of the 24th International Conference on Machine Learning (ICML-2007), ACM International Conference Proceeding Series 227. ACM, New York, NY, 625632.

S. Muggleton 1995. Inverse entailment and Progol. New Generation Computing 13, 245286.

D. Ourston and R. J. Mooney 1994. Theory refinement combining analytical and empirical methods. Artificial Intelligence 66, 273309.

D. Poole 1993. Logic programming, abduction and probability – a top-down anytime algorithm for estimating prior and posterior probabilities. New Generation Computing 11, 377400.

D. Poole 1997. The independent choice logic for modelling multiple agents under uncertainty. Artificial Intelligence 94, 756.

T. C. Przymusinski 1989. Every logic program has a natural stratification and an iterated least fixed point model. In Proceedings of the 8th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS-1989). ACM Press, New York, NY, 1121.

A. Rauzy , E. Châtelet , Y. Dutuit and C. Bérenguer 2003. A practical comparison of methods to assess sum-of-products. Reliability Engineering and System Safety 79, 3342.

B. L. Richards and R. J. Mooney 1995. Automated refinement of first-order Horn-clause domain theories. Machine Learning 19, 95131.

M. Richardson and P. Domingos 2006. Markov logic networks. Machine Learning 62, 107136.

F. Riguzzi 2008a. ALLPAD: Approximate Learning of Logic Programs with Annotated Disjunctions. Machine Learning 70, 207223.

F. Riguzzi 2009. Extended semantics and inference for the independent choice logic. Logic Journal of the IGPL 17, 589629.

F. Riguzzi and N. Di Mauro 2012. Applying the information bottleneck to statistical relational learning. Machine Learning 86, 89114.

F. Riguzzi and T. Swift 2011. The PITA system: Tabling and answer subsumption for reasoning under uncertainty. Theory and Practice of Logic Programming, International Conference on Logic Programming (ICLP) Special Issue 11, 433449.

G. Schwarz 1978. Estimating the dimension of a model. The Annals of Statistics 6, 461464.

A. Srinivasan , S. Muggleton , M. J. E. Sternberg and R. D. King 1996. Theories for mutagenicity: A study in first-order and feature-based induction. Artificial Intelligence 85, 277299.

A. Van Gelder , K. A. Ross and J. S. Schlipf 1991. The well–founded semantics for general logic programs. Journal of the ACM 38, 620650.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Theory and Practice of Logic Programming
  • ISSN: 1471-0684
  • EISSN: 1475-3081
  • URL: /core/journals/theory-and-practice-of-logic-programming
Please enter your name
Please enter a valid email address
Who would you like to send this to? *



Full text views

Total number of HTML views: 0
Total number of PDF views: 17 *
Loading metrics...

Abstract views

Total abstract views: 757 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 26th July 2017. This data will be updated every 24 hours.