{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T06:24:04Z","timestamp":1761719044024,"version":"3.37.3"},"reference-count":68,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T00:00:00Z","timestamp":1623715200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T00:00:00Z","timestamp":1623715200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100007109","name":"Universit\u00e0 degli Studi di Ferrara","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100007109","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2021,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Probabilistic logic programming (PLP) combines logic programs and probabilities. Due to its expressiveness and simplicity, it has been considered as a powerful tool for learning and reasoning in relational domains characterized by uncertainty. Still, learning the parameter and the structure of general PLP is computationally expensive due to the inference cost. We have recently proposed a restriction of the general PLP language called hierarchical PLP (HPLP) in which clauses and predicates are hierarchically organized. HPLPs can be converted into arithmetic circuits or deep neural networks and inference is much cheaper than for general PLP. In this paper we present algorithms for learning both the parameters and the structure of HPLPs from data. We first present an algorithm, called parameter learning for hierarchical probabilistic logic programs (PHIL) which performs parameter estimation of HPLPs using gradient descent and expectation maximization. We also propose structure learning of hierarchical probabilistic logic programming (SLEAHP), that learns both the structure and the parameters of HPLPs from data. Experiments were performed comparing PHIL and SLEAHP with PLP and Markov Logic Networks state-of-the art systems for parameter and structure learning respectively. PHIL was compared with EMBLEM, ProbLog2 and Tuffy and SLEAHP with SLIPCOVER, PROBFOIL+, MLB-BC, MLN-BT and RDN-B. The experiments on five well known datasets show that our algorithms achieve similar and often better accuracies but in a shorter time.<\/jats:p>","DOI":"10.1007\/s10994-021-06016-4","type":"journal-article","created":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T15:04:11Z","timestamp":1623769451000},"page":"1637-1693","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Learning hierarchical probabilistic logic programs"],"prefix":"10.1007","volume":"110","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3352-5260","authenticated-orcid":false,"given":"Arnaud","family":"Nguembang Fadja","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1654-9703","authenticated-orcid":false,"given":"Fabrizio","family":"Riguzzi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2747-4292","authenticated-orcid":false,"given":"Evelina","family":"Lamma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,15]]},"reference":[{"issue":"6","key":"6016_CR1","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1109\/TC.1978.1675141","volume":"27","author":"SB Akers","year":"1978","unstructured":"Akers, S. B. (1978). Binary decision diagrams. IEEE Transactions on Computers, 27(6), 509\u2013516.","journal-title":"IEEE Transactions on Computers"},{"issue":"1","key":"6016_CR2","doi-asserted-by":"publisher","first-page":"47","DOI":"10.3233\/IA-170105","volume":"11","author":"M Alberti","year":"2017","unstructured":"Alberti, M., Bellodi, E., Cota, G., Riguzzi, F., & Zese, R. (2017). cplint on SWISH: Probabilistic logical inference with a web browser. Artificial Intelligence, 11(1), 47\u201364. https:\/\/doi.org\/10.3233\/IA-170105.","journal-title":"Artificial Intelligence"},{"key":"6016_CR3","doi-asserted-by":"publisher","unstructured":"Alberti, M., Cota, G., Riguzzi, F., & Zese, R. (2016). Probabilistic logical inference on the web. In: G.\u00a0Adorni, S.\u00a0Cagnoni, M.\u00a0Gori, M.\u00a0Maratea (Eds.) AI*IA 2016, LNCS, vol. 10037, pp. 351\u2013363. Springer. https:\/\/doi.org\/10.1007\/978-3-319-49130-1_26.","DOI":"10.1007\/978-3-319-49130-1_26"},{"key":"6016_CR4","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1089\/cmb.2005.12.584","volume":"12","author":"N Beerenwinkel","year":"2005","unstructured":"Beerenwinkel, N., Rahnenf\u00fchrer, J., D\u00e4umer, M., Hoffmann, D., Kaiser, R., Selbig, J., & Lengauer, T. (2005). Learning multiple evolutionary pathways from cross-sectional data. Journal of Computational Biology, 12, 584\u2013598.","journal-title":"Journal of Computational Biology"},{"key":"6016_CR5","doi-asserted-by":"crossref","unstructured":"Bellodi, E., & Riguzzi, F. (2012). Learning the structure of probabilistic logic programs. In S. Muggleton, A. Tamaddoni-Nezhad, & F. Lisi (Eds.), 22nd international conference on inductive logic programming, LNCS (Vol. 7207, pp. 61\u201375). Springer.","DOI":"10.1007\/978-3-642-31951-8_10"},{"issue":"2","key":"6016_CR6","doi-asserted-by":"publisher","first-page":"343","DOI":"10.3233\/IDA-130582","volume":"17","author":"E Bellodi","year":"2013","unstructured":"Bellodi, E., & Riguzzi, F. (2013). Expectation maximization over binary decision diagrams for probabilistic logic programs. Intelligent Data Analysis, 17(2), 343\u2013363.","journal-title":"Intelligent Data Analysis"},{"issue":"2","key":"6016_CR7","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1017\/S1471068413000689","volume":"15","author":"E Bellodi","year":"2015","unstructured":"Bellodi, E., & Riguzzi, F. (2015). Structure learning of probabilistic logic programs by searching the clause space. Theory and Practice of Logic Programming, 15(2), 169\u2013212. https:\/\/doi.org\/10.1017\/S1471068413000689.","journal-title":"Theory and Practice of Logic Programming"},{"key":"6016_CR8","unstructured":"Bishop, C. (2016). Pattern Recognition and Machine Learning. Information Science and Statistics. Springer."},{"key":"6016_CR9","doi-asserted-by":"crossref","unstructured":"Clark, K. L. (1978). Negation as failure. In Logic and data bases (pp. 293\u2013322). Springer.","DOI":"10.1007\/978-1-4684-3384-5_11"},{"key":"6016_CR10","doi-asserted-by":"crossref","unstructured":"Cox, D. A. (2012). Galois Theory. Pure and Applied Mathematics.?: A Wiley Series of Texts, Monographs and Tracts. Hoboken: Wiley.","DOI":"10.1002\/9781118218457"},{"issue":"7","key":"6016_CR11","doi-asserted-by":"publisher","first-page":"1063","DOI":"10.1007\/s10994-019-05862-7","volume":"108","author":"A Cropper","year":"2019","unstructured":"Cropper, A., Morel, R., & Muggleton, S. (2019). Learning higher-order logic programs. Machine Learning, 108(7), 1063\u20131083. https:\/\/doi.org\/10.1007\/s10994-019-05862-7.","journal-title":"Machine Learning"},{"issue":"7","key":"6016_CR12","doi-asserted-by":"publisher","first-page":"1063","DOI":"10.1007\/s10994-018-5712-6","volume":"108","author":"A Cropper","year":"2019","unstructured":"Cropper, A., & Muggleton, S. H. (2019). Learning efficient logic programs. Machine Learning, 108(7), 1063\u20131083. https:\/\/doi.org\/10.1007\/s10994-018-5712-6.","journal-title":"Machine Learning"},{"key":"6016_CR13","first-page":"328","volume-title":"16th European conference on artificial intelligence (ECAI 20014)","author":"A Darwiche","year":"2004","unstructured":"Darwiche, A. (2004). New advances in compiling CNF into decomposable negation normal form. In R. L. de M\u00e1ntaras & L. Saitta (Eds.), 16th European conference on artificial intelligence (ECAI 20014) (pp. 328\u2013332). Amsterdam: IOS Press."},{"key":"6016_CR14","doi-asserted-by":"crossref","unstructured":"Davis, J., & Goadrich, M. (2006). The relationship between precision-recall and roc curves. In Proceedings of the 23rd international conference on Machine learning (pp. 233\u2013240). ACM.","DOI":"10.1145\/1143844.1143874"},{"key":"6016_CR15","unstructured":"De Raedt, L., Kimmig, A., & Toivonen, H. (2007). ProbLog: A probabilistic Prolog and its application in link discovery. In: M.M. Veloso (ed.) IJCAI 2007 (Vol.\u00a07, pp. 2462\u20132467). AAAI Press\/IJCAI."},{"key":"6016_CR16","unstructured":"De\u00a0Raedt, L., Manhaeve, R., Dumancic, S., Demeester, T., & Kimmig, A. (2019). Neuro-symbolic= neural+ logical+ probabilistic. In NeSy\u201919@ IJCAI, the 14th International Workshop on Neural-Symbolic Learning and Reasoning (pp. 1\u20134)."},{"key":"6016_CR17","volume-title":"Practical PostgreSQL","author":"JD Drake","year":"2002","unstructured":"Drake, J. D., & Worsley, J. C. (2002). Practical PostgreSQL. Newton: O\u2019Reilly Media Inc."},{"key":"6016_CR18","unstructured":"D\u017eeroski, S. (1993). Handling imperfect data in inductive logic programming. In 4th Scandinavian conference on artificial intelligence (SCAI 1993) (pp. 111\u2013125)."},{"issue":"3","key":"6016_CR19","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1017\/S1471068414000076","volume":"15","author":"D Fierens","year":"2015","unstructured":"Fierens, D., Van den Broeck, G., Renkens, J., Shterionov, D. S., Gutmann, B., Thon, I., et al. (2015). Inference and learning in probabilistic logic programs using weighted Boolean formulas. Theory and Practice of Logic Programming, 15(3), 358\u2013401.","journal-title":"Theory and Practice of Logic Programming"},{"key":"6016_CR20","unstructured":"Gelfond, M., & Lifschitz, V. (1988). The stable model semantics for logic programming. In 5th international conference and symposium on logic programming (ICLP\/SLP 1988) (vol.\u00a088, pp. 1070\u20131080). MIT Press."},{"key":"6016_CR21","doi-asserted-by":"publisher","unstructured":"Gerla, G. (2001). Fuzzy logic, trends in logic (Vol. 11). Springer. https:\/\/doi.org\/10.1007\/978-94-015-9660-2_8.","DOI":"10.1007\/978-94-015-9660-2_8"},{"key":"6016_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-011-5300-3","volume-title":"Metamathematics of fuzzy logic","author":"P H\u00e1jek","year":"1998","unstructured":"H\u00e1jek, P. (1998). Metamathematics of fuzzy logic. Berlin: Springer."},{"key":"6016_CR23","doi-asserted-by":"crossref","unstructured":"Huynh, T. N., & Mooney, R. J. (2011). Online structure learning for markov logic networks. In Joint European conference on machine learning and knowledge discovery in databases (pp. 81\u201396). Springer.","DOI":"10.1007\/978-3-642-23783-6_6"},{"key":"6016_CR24","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1090\/dimacs\/035\/15","volume":"35","author":"HA Kautz","year":"1996","unstructured":"Kautz, H. A., Selman, B., & Jiang, Y. (1996). A general stochastic approach to solving problems with hard and soft constraints. Satisfiability Problem: Theory and Applications, 35, 573\u2013586.","journal-title":"Satisfiability Problem: Theory and Applications"},{"key":"6016_CR25","doi-asserted-by":"crossref","unstructured":"Kazemi, S. M., & Poole, D. (2018). Relnn: A deep neural model for relational learning. In Thirty-second AAAI conference on artificial intelligence.","DOI":"10.1609\/aaai.v32i1.12111"},{"key":"6016_CR26","doi-asserted-by":"crossref","unstructured":"Khot, T., Natarajan, S., Kersting, K., & Shavlik, J. (2011). Learning markov logic networks via functional gradient boosting. In 2011 IEEE 11th international conference on data mining (pp. 320\u2013329). IEEE.","DOI":"10.1109\/ICDM.2011.87"},{"key":"6016_CR27","unstructured":"Kingma, D., & Ba, J. (2014). Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980."},{"key":"6016_CR28","doi-asserted-by":"crossref","unstructured":"Kok, S., & Domingos, P. (2005). Learning the structure of Markov Logic Networks. In ICML 2005 (pp. 441\u2013448). ACM.","DOI":"10.1145\/1102351.1102407"},{"key":"6016_CR29","doi-asserted-by":"crossref","unstructured":"Law, M., Russo, A., & Broda, K. (2016). Iterative learning of answer set programs from context dependent examples. arXiv preprint arXiv:1608.01946.","DOI":"10.1017\/S1471068416000351"},{"key":"6016_CR30","unstructured":"Lee, S. I., Ganapathi, V., & Koller, D. (2007). Efficient structure learning of markov networks using $$l\\_1$$-regularization. In Advances in neural Information processing systems (pp. 817\u2013824)."},{"key":"6016_CR31","unstructured":"Li, H., Zhang, K., & Jiang, T. (2005). The regularized em algorithm. AAAI (pp. 807\u2013812)."},{"key":"6016_CR32","doi-asserted-by":"crossref","unstructured":"Lowd, D., & Domingos, P. (2007). Efficient weight learning for markov logic networks. In European conference on principles of data mining and knowledge discovery (pp. 200\u2013211). Springer.","DOI":"10.1007\/978-3-540-74976-9_21"},{"key":"6016_CR33","unstructured":"Lowd, D., & Rooshenas, A. (2013). Learning markov networks with arithmetic circuits. In: Artificial intelligence and statistics (pp. 406\u2013414)."},{"key":"6016_CR34","volume-title":"Information extraction and integration: The mondial case study","author":"W May","year":"1999","unstructured":"May, W. (1999). Information extraction and integration: The mondial case study. Tech. rep.: Universitat Freiburg, Institut f\u00fcr Informatik."},{"key":"6016_CR35","doi-asserted-by":"publisher","unstructured":"Meert, W., Struyf, J., & Blockeel, H. (2010). CP-Logic theory inference with contextual variable elimination and comparison to BDD based inference methods. In: L.\u00a0De\u00a0Raedt (ed.) ILP 2009, LNCS (vol. 5989, pp. 96\u2013109). Springer. https:\/\/doi.org\/10.1007\/978-3-642-13840-9_10.","DOI":"10.1007\/978-3-642-13840-9_10"},{"issue":"5","key":"6016_CR36","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1093\/bioinformatics\/btr698","volume":"28","author":"S M\u00f8rk","year":"2012","unstructured":"M\u00f8rk, S., & Holmes, I. (2012). Evaluating bacterial gene-finding hmm structures as probabilistic logic programs. Bioinformatics, 28(5), 636\u2013642.","journal-title":"Bioinformatics"},{"key":"6016_CR37","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/BF03037227","volume":"13","author":"S Muggleton","year":"1995","unstructured":"Muggleton, S. (1995). Inverse entailment and Progol. New Generation Computing, 13, 245\u2013286.","journal-title":"New Generation Computing"},{"issue":"1","key":"6016_CR38","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10994-011-5244-9","volume":"86","author":"S Natarajan","year":"2012","unstructured":"Natarajan, S., Khot, T., Kersting, K., Gutmann, B., & Shavlik, J. (2012). Gradient-based boosting for statistical relational learning: The relational dependency network case. Machine Learning, 86(1), 25\u201356.","journal-title":"Machine Learning"},{"key":"6016_CR39","unstructured":"Nguembang Fadja, A., Lamma, E., & Riguzzi, F. (2017). Deep probabilistic logic programming. In: C.\u00a0Theil Have, R.\u00a0Zese (eds.) PLP 2017, CEUR-WS (vol. 1916, pp. 3\u201314). Sun SITE Central Europe."},{"key":"6016_CR40","doi-asserted-by":"publisher","unstructured":"Nguembang Fadja, A., & Riguzzi, F. (2017). Probabilistic logic programming in action. In: A.\u00a0Holzinger, R.\u00a0Goebel, M.\u00a0Ferri, V.\u00a0Palade (eds.) Towards integrative machine learning and knowledge extraction, LNCS (vol. 10344). Springer. https:\/\/doi.org\/10.1007\/978-3-319-69775-8_5.","DOI":"10.1007\/978-3-319-69775-8_5"},{"key":"6016_CR41","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-018-5750-0","author":"A Nguembang Fadja","year":"2018","unstructured":"Nguembang Fadja, A., & Riguzzi, F. (2018). Lifted discriminative learning of probabilistic logic programs. Machine Learning. https:\/\/doi.org\/10.1007\/s10994-018-5750-0.","journal-title":"Machine Learning"},{"key":"6016_CR42","doi-asserted-by":"crossref","unstructured":"Nguembang\u00a0Fadja, A., Riguzzi, F., & Lamma, E. (2018). Expectation maximization in deep probabilistic logic programming. In International conference of the italian association for artificial intelligence (pp. 293\u2013306). Springer.","DOI":"10.1007\/978-3-030-03840-3_22"},{"key":"6016_CR43","doi-asserted-by":"crossref","unstructured":"Niu, F., R\u00e9, C., Doan, A., & Shavlik, J. (2011). Tuffy: Scaling up statistical inference in markov logic networks using an rdbms. arXiv preprint arXiv:1104.3216.","DOI":"10.14778\/1978665.1978669"},{"key":"6016_CR44","volume-title":"Probabilistic reasoning in intelligent systems: Networks of plausible inference","author":"J Pearl","year":"1988","unstructured":"Pearl, J. (1988). Probabilistic reasoning in intelligent systems: Networks of plausible inference. Burlington: Morgan Kaufmann."},{"key":"6016_CR45","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/S0004-3702(97)00027-1","volume":"94","author":"D Poole","year":"1997","unstructured":"Poole, D. (1997). The Independent Choice Logic for modelling multiple agents under uncertainty. Artificial Intelligence, 94, 7\u201356.","journal-title":"Artificial Intelligence"},{"key":"6016_CR46","doi-asserted-by":"crossref","unstructured":"Przymusinski, T. C. (1989). Every logic program has a natural stratification and an iterated least fixed point model. In 8th ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems (PODS 1989) (pp. 11\u201321). ACM Press.","DOI":"10.1145\/73721.73723"},{"key":"6016_CR47","unstructured":"Raedt, L. D., Dries, A., Thon, I., den Broeck, G. V., & Verbeke, M. (2015). Inducing probabilistic relational rules from probabilistic examples. In: Q.\u00a0Yang, M.\u00a0Wooldridge (Eds.) 24th international joint conference on artificial intelligence (IJCAI 2015) (pp. 1835\u20131843). AAAI Press."},{"issue":"1","key":"6016_CR48","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0020-0190(97)00223-8","volume":"65","author":"V Raman","year":"1998","unstructured":"Raman, V., Ravikumar, B., & Rao, S. S. (1998). A simplified np-complete maxsat problem. Information Processing Letters, 65(1), 1\u20136.","journal-title":"Information Processing Letters"},{"issue":"3","key":"6016_CR49","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1093\/comjnl\/bxt096","volume":"57","author":"F Riguzzi","year":"2014","unstructured":"Riguzzi, F. (2014). Speeding up inference for probabilistic logic programs. Computer Journal, 57(3), 347\u2013363. https:\/\/doi.org\/10.1093\/comjnl\/bxt096.","journal-title":"Computer Journal"},{"key":"6016_CR50","volume-title":"Foundations of Probabilistic Logic Programming","author":"F Riguzzi","year":"2018","unstructured":"Riguzzi, F. (2018). Foundations of Probabilistic Logic Programming. Gistrup: River Publishers."},{"key":"6016_CR51","doi-asserted-by":"publisher","unstructured":"Riguzzi, F., Bellodi, E., Lamma, E., Zese, R., & Cota, G. (2016). Probabilistic logic programming on the web. Software: Practice and Experience, 46(10), 1381\u20131396. https:\/\/doi.org\/10.1002\/spe.2386.","DOI":"10.1002\/spe.2386"},{"key":"6016_CR52","unstructured":"Riguzzi, F., Lamma, E., Alberti, M., Bellodi, E., Zese, R., & Cota, G. (2017). Probabilistic logic programming for natural language processing. In: F.\u00a0Chesani, P.\u00a0Mello, M.\u00a0Milano (Eds.) Workshop on deep understanding and reasoning, URANIA 2016, CEUR Workshop Proceedings (Vol. 1802, pp. 30\u201337). Sun SITE Central Europe."},{"key":"6016_CR53","doi-asserted-by":"publisher","unstructured":"Riguzzi, F., & Swift, T. (2010). Tabling and answer subsumption for reasoning on logic programs with annotated disjunctions. In ICLP TC 2010, LIPIcs (Vol.\u00a07, pp. 162\u2013171). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https:\/\/doi.org\/10.4230\/LIPIcs.ICLP.2010.162.","DOI":"10.4230\/LIPIcs.ICLP.2010.162"},{"issue":"4\u20135","key":"6016_CR54","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1017\/S147106841100010X","volume":"11","author":"F Riguzzi","year":"2011","unstructured":"Riguzzi, F., & Swift, T. (2011). The PITA system: Tabling and answer subsumption for reasoning under uncertainty. Theory and Practice of Logic Programming, 11(4\u20135), 433\u2013449. https:\/\/doi.org\/10.1017\/S147106841100010X.","journal-title":"Theory and Practice of Logic Programming"},{"key":"6016_CR55","doi-asserted-by":"crossref","unstructured":"Rooshenas, A., & Lowd, D. (2016). Discriminative structure learning of arithmetic circuits. In Artificial intelligence and statistics (pp. 1506\u20131514).","DOI":"10.1609\/aaai.v30i1.9963"},{"key":"6016_CR56","unstructured":"Sang, T., Beame, P., & Kautz, H. A. (2005). Performing Bayesian inference by weighted model counting. 20th national conference on artificial intelligence (pp. 475\u2013482). Palo Alto, California USA: AAAI Press."},{"key":"6016_CR57","doi-asserted-by":"crossref","unstructured":"Sato, T. (1995). A statistical learning method for logic programs with distribution semantics. In L.\u00a0Sterling (ed.) ICLP 1995, pp. 715\u2013729. MIT Press.","DOI":"10.7551\/mitpress\/4298.003.0069"},{"key":"6016_CR58","unstructured":"Sato, T., Zhou, N.F., Kameya, Y., Izumi, Y., Kubota, K., & Kojima, R. (2018). PRISM user\u2019s manual (Version 2.3) (2017). http:\/\/rjida.meijo-u.ac.jp\/prism\/download\/prism23.pdf. Accessed 8 June 2018."},{"key":"6016_CR59","unstructured":"Sourek, G., Aschenbrenner, V., Zelezn\u00fd, F., & Kuzelka, O. (2016). Lifted relational neural networks. In T.R. Besold, A.S. d\u2019Avila Garcez, G.F. Marcus, R.\u00a0Miikkulainen (Eds.) NIPS workshop on cognitive computation 2015, CEUR Workshop Proceedings (Vol. 1583). CEUR-WS.org."},{"key":"6016_CR60","doi-asserted-by":"crossref","unstructured":"Srinivasan, A., King, R. D., Muggleton, S., & Sternberg, M. J. E. (1997). Carcinogenesis predictions using ILP. In N. Lavrac & S. D\u017eeroski (Eds.), ILP 1997, LNCS (Vol. 1297, pp. 273\u2013287). Springer.","DOI":"10.1007\/3540635149_56"},{"issue":"1\u20132","key":"6016_CR61","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0004-3702(95)00122-0","volume":"85","author":"A Srinivasan","year":"1996","unstructured":"Srinivasan, A., Muggleton, S., Sternberg, M. J. E., & King, R. D. (1996). Theories for mutagenicity: A study in first-order and feature-based induction. Artificial Intelligence, 85(1\u20132), 277\u2013299.","journal-title":"Artificial Intelligence"},{"issue":"1\u20132","key":"6016_CR62","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1017\/S1471068411000500","volume":"12","author":"T Swift","year":"2012","unstructured":"Swift, T., & Warren, D. S. (2012). XSB: Extending prolog with tabled logic programming. Theory and Practice of Logic Programming, 12(1\u20132), 157\u2013187. https:\/\/doi.org\/10.1017\/S1471068411000500.","journal-title":"Theory and Practice of Logic Programming"},{"issue":"3","key":"6016_CR63","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1145\/116825.116838","volume":"38","author":"A Van Gelder","year":"1991","unstructured":"Van Gelder, A., Ross, K. A., & Schlipf, J. S. (1991). The well-founded semantics for general logic programs. Journal of the ACM, 38(3), 620\u2013650.","journal-title":"Journal of the ACM"},{"key":"6016_CR64","doi-asserted-by":"crossref","unstructured":"Vennekens, J., Verbaeten, S., & Bruynooghe, M. (2004). Logic Programs With Annotated Disjunctions. In: ICLP 2004, LNCS (Vol. 3132, pp. 431\u2013445). Springer.","DOI":"10.1007\/978-3-540-27775-0_30"},{"issue":"1\u20132","key":"6016_CR65","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1017\/S1471068411000494","volume":"12","author":"J Wielemaker","year":"2012","unstructured":"Wielemaker, J., Schrijvers, T., Triska, M., & Lager, T. (2012). SWI-prolog. Theory and Practice of Logic Programming, 12(1\u20132), 67\u201396.","journal-title":"Theory and Practice of Logic Programming"},{"issue":"1\u20133","key":"6016_CR66","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s10994-006-7733-9","volume":"64","author":"F \u017delezn\u1ef3","year":"2006","unstructured":"\u017delezn\u1ef3, F., Srinivasan, A., & Page, C. D. (2006). Randomised restarted search in ILP. Machine Learning, 64(1\u20133), 183\u2013208.","journal-title":"Machine Learning"},{"key":"6016_CR67","doi-asserted-by":"crossref","unstructured":"\u017delezn\u1ef3, F., Srinivasan, A., & Page, D. (2002). Lattice-search runtime distributions may be heavy-tailed. In International conference on inductive logic programming (pp. 333\u2013345). Springer.","DOI":"10.1007\/3-540-36468-4_22"},{"key":"6016_CR68","doi-asserted-by":"crossref","unstructured":"\u017delezn\u1ef3, F., Srinivasan, A.., & Page, D. (2004). A monte carlo study of randomised restarted search in ilp. In International conference on inductive logic programming (pp. 341\u2013358). Springer.","DOI":"10.1007\/978-3-540-30109-7_25"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-021-06016-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10994-021-06016-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-021-06016-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,1]],"date-time":"2024-09-01T21:14:35Z","timestamp":1725225275000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10994-021-06016-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,15]]},"references-count":68,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["6016"],"URL":"https:\/\/doi.org\/10.1007\/s10994-021-06016-4","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"type":"print","value":"0885-6125"},{"type":"electronic","value":"1573-0565"}],"subject":[],"published":{"date-parts":[[2021,6,15]]},"assertion":[{"value":"19 March 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 May 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 May 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 June 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}