{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T05:20:31Z","timestamp":1768454431420,"version":"3.49.0"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,11,10]],"date-time":"2020-11-10T00:00:00Z","timestamp":1604966400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,11,10]],"date-time":"2020-11-10T00:00:00Z","timestamp":1604966400000},"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,4]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Probabilistic logical models deal effectively with uncertain relations and entities typical of many real world domains. In the field of probabilistic logic programming usually the aim is to learn these kinds of models to predict specific atoms or predicates of the domain, called target atoms\/predicates. However, it might also be useful to learn classifiers for interpretations as a whole: to this end, we consider the models produced by the inductive constraint logic system, represented by sets of<jats:italic>integrity constraints<\/jats:italic>, and we propose a probabilistic version of them. Each integrity constraint is annotated with a probability, and the resulting probabilistic logical constraint model assigns a probability of being positive to interpretations. To learn both the structure and the parameters of such probabilistic models we propose the system PASCAL for \u201cprobabilistic inductive constraint logic\u201d. Parameter learning can be performed using gradient descent or L-BFGS. PASCAL has been tested on 11 datasets and compared with a few statistical relational systems and a system that builds relational decision trees (TILDE): we demonstrate that this system achieves better or comparable results in terms of area under the precision\u2013recall and receiver operating characteristic curves, in a comparable execution time.<\/jats:p>","DOI":"10.1007\/s10994-020-05911-6","type":"journal-article","created":{"date-parts":[[2020,11,10]],"date-time":"2020-11-10T18:02:54Z","timestamp":1605031374000},"page":"723-754","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Probabilistic inductive constraint logic"],"prefix":"10.1007","volume":"110","author":[{"given":"Fabrizio","family":"Riguzzi","sequence":"first","affiliation":[]},{"given":"Elena","family":"Bellodi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8352-6304","authenticated-orcid":false,"given":"Riccardo","family":"Zese","sequence":"additional","affiliation":[]},{"given":"Marco","family":"Alberti","sequence":"additional","affiliation":[]},{"given":"Evelina","family":"Lamma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,11,10]]},"reference":[{"key":"5911_CR1","unstructured":"Alberti, M., Bellodi, E., Cota, G., Lamma, E., Riguzzi, F., & Zese, R. (2016). Probabilistic constraint logic theories. In: A.\u00a0Hommersom, S.\u00a0Abdallah (Eds.) Proceedings of the 3nd international workshop on probabilistic logic programming (PLP), CEUR Workshop Proceedings (vol. 1661, pp. 15\u201328). Sun SITE Central Europe, Aachen, Germany. http:\/\/ceur-ws.org\/Vol-1661\/#paper-02"},{"issue":"4","key":"5911_CR2","doi-asserted-by":"publisher","first-page":"29:1","DOI":"10.1145\/1380572.1380578","volume":"9","author":"M Alberti","year":"2008","unstructured":"Alberti, M., Chesani, F., Gavanelli, M., Lamma, E., Mello, P., & Torroni, P. (2008). Verifiable agent interaction in abductive logic programming: The SCIFF framework. ACM Transactions on Computer Logic, 9(4), 29:1\u201329:43.","journal-title":"ACM Transactions on Computer Logic"},{"key":"5911_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, Lecture Notes in Computer Science, 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"},{"issue":"3\u20134","key":"5911_CR4","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/BF03037168","volume":"9","author":"KR Apt","year":"1991","unstructured":"Apt, K. R., & Bezem, M. (1991). Acyclic programs. New Generation Computing, 9(3\u20134), 335\u2013363.","journal-title":"New Generation Computing"},{"key":"5911_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). Berlin: Springer.","DOI":"10.1007\/978-3-642-31951-8_10"},{"issue":"2","key":"5911_CR6","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"},{"issue":"1","key":"5911_CR7","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1023\/A:1009867806624","volume":"3","author":"H Blockeel","year":"1999","unstructured":"Blockeel, H., De Raedt, L., Jacobs, N., & Demoen, B. (1999). Scaling up inductive logic programming by learning from interpretations. Data Mining and Knowledge Discovery, 3(1), 59\u201393.","journal-title":"Data Mining and Knowledge Discovery"},{"issue":"1\u20132","key":"5911_CR8","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/S0004-3702(98)00034-4","volume":"101","author":"H Blockeel","year":"1998","unstructured":"Blockeel, H., & De Raedt, L. (1998). Top-down induction of first-order logical decision trees. Artificial Intelligence, 101(1\u20132), 285\u2013297. https:\/\/doi.org\/10.1016\/S0004-3702(98)00034-4.","journal-title":"Artificial Intelligence"},{"key":"5911_CR9","volume-title":"Pattern recognition","author":"MM Bongard","year":"1970","unstructured":"Bongard, M. M. (1970). Pattern recognition. Spartan Books: Hayden Book Co., Spartan Books"},{"key":"5911_CR10","unstructured":"Bruynooghe, M., Mantadelis, T., Kimmig, A., Gutmann, B., Vennekens, J., Janssens, G., & De Raedt, L. (2010). Problog technology for inference in a probabilistic first order logic. In ECAI 2010 - 19th European conference on artificial intelligence, Lisbon, Portugal, August 16\u201320, 2010, proceedings, frontiers in artificial intelligence and applications, vol. 215, pp. 719\u2013724. IOS Press."},{"issue":"83","key":"5911_CR11","first-page":"536","volume":"225","author":"A Cauchy","year":"1847","unstructured":"Cauchy, A. (1847). M\u00e9thode g\u00e9n\u00e9rale pour la r\u00e9solution des systemes d\u2019\u00e9quations simultan\u00e9es. Comptes Rendus Academic Science Paris, 225(83), 536\u2013538.","journal-title":"Comptes Rendus Academic Science Paris"},{"key":"5911_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-3384-5_11","volume-title":"Logic and data bases","author":"KL Clark","year":"1978","unstructured":"Clark, K. L. (1978). Negation as failure. In H. Gallaire & J. Minker (Eds.), Logic and data bases. Boston, MA: Springer. https:\/\/doi.org\/10.1007\/978-1-4684-3384-5_11."},{"key":"5911_CR13","doi-asserted-by":"crossref","unstructured":"Davis, J., & Goadrich, M. (2006). The relationship between precision-recall and ROC curves. In ECML 2006 pp. 233\u2013240). ACM","DOI":"10.1145\/1143844.1143874"},{"issue":"2\u20133","key":"5911_CR14","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1023\/A:1007361123060","volume":"26","author":"L De Raedt","year":"1997","unstructured":"De Raedt, L., & Dehaspe, L. (1997). Clausal discovery. Machine Learning, 26(2\u20133), 99\u2013146.","journal-title":"Machine Learning"},{"issue":"1\u20132","key":"5911_CR15","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/0004-3702(94)90112-0","volume":"70","author":"L De Raedt","year":"1994","unstructured":"De Raedt, L., & D\u017eeroski, S. (1994). First-Order jk-Clausal Theories are PAC-Learnable. Artificial Intelligence, 70(1\u20132), 375\u2013392.","journal-title":"Artificial Intelligence"},{"key":"5911_CR16","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":"5911_CR17","doi-asserted-by":"crossref","unstructured":"De\u00a0Raedt, L., & Van\u00a0Laer, W. (1995). Inductive constraint logic. In: ALT 1995, Lecture Notes in Artificial Intelligence (Vol. 997, pp. 80\u201394). Springer.","DOI":"10.1007\/3-540-60454-5_30"},{"issue":"1","key":"5911_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"AP Dempster","year":"1977","unstructured":"Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977). Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society: Series B (Methodological), 39(1), 1\u201338.","journal-title":"Journal of the Royal Statistical Society: Series B (Methodological)"},{"issue":"1","key":"5911_CR19","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10994-015-5510-3","volume":"100","author":"N Di Mauro","year":"2015","unstructured":"Di Mauro, N., Bellodi, E., & Riguzzi, F. (2015). Bandit-based Monte-Carlo structure learning of probabilistic logic programs. Machine Learning, 100(1), 127\u2013156. https:\/\/doi.org\/10.1007\/s10994-015-5510-3.","journal-title":"Machine Learning"},{"key":"5911_CR20","unstructured":"Domingos, P., & Webb, W.A. (2012). A tractable first-order probabilistic logic. In J.\u00a0Hoffmann, B.\u00a0Selman (Eds.) Twenty-Sixth AAAI Conference on Artificial Intelligence (AAAI-12). AAAI Press."},{"issue":"3","key":"5911_CR21","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1023\/B:MACH.0000039778.69032.ab","volume":"57","author":"PA Flach","year":"2004","unstructured":"Flach, P. A., & Lachiche, N. (2004). Naive Bayesian classification of structured data. Machine Learning, 57(3), 233\u2013269. https:\/\/doi.org\/10.1023\/B:MACH.0000039778.69032.ab.","journal-title":"Machine Learning"},{"key":"5911_CR22","unstructured":"Gavanelli, M., Lamma, E., Riguzzi, F., Bellodi, E., Zese, R., & Cota, G. (2015). An abductive framework for datalog$$\\pm$$ ontologies. In: M.D. Vos, T.\u00a0Eiter, Y.\u00a0Lierler, F.\u00a0Toni (Eds.) Technical communications of the 31st international conference on logic programming (ICLP 2015), CEUR workshop proceedings (vol. 1433). CEUR-WS.org."},{"issue":"1","key":"5911_CR23","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1006\/jagm.1997.0913","volume":"27","author":"DM Gordon","year":"1998","unstructured":"Gordon, D. M. (1998). A survey of fast exponentiation methods. Journal of Algorithms, 27(1), 129\u2013146. https:\/\/doi.org\/10.1006\/jagm.1997.0913.","journal-title":"Journal of Algorithms"},{"key":"5911_CR24","doi-asserted-by":"crossref","unstructured":"Kapur, D., & Narendran, P. (1986). Np-completeness of the set unification and matching problems. In International conference on automated deduction (pp 489\u2013495). Springer.","DOI":"10.1007\/3-540-16780-3_113"},{"key":"5911_CR25","doi-asserted-by":"crossref","unstructured":"Khot, T., Natarajan, S., Kersting, K., & Shavlik, J.W. (2011). Learning Markov Logic Networks via functional gradient boosting. In Proceedings of the 11th IEEE international conference on data mining (pp. 320\u2013329). IEEE.","DOI":"10.1109\/ICDM.2011.87"},{"key":"5911_CR26","unstructured":"Kok, S., & Domingos, P. (2010). Learning Markov logic networks using structural motifs. In: J.\u00a0F\u00fcrnkranz, T.\u00a0Joachims (Eds.) ICML 2010 (pp. 551\u2013558). Omnipress."},{"key":"5911_CR27","unstructured":"Lafferty, J., McCallum, A., & Pereira, F. (2001). Conditional random fields: Probabilistic models for segmenting and labeling sequence data. In 18th International Conference on Machine Learning (vol.\u00a01, pp. 282\u2013289)."},{"key":"5911_CR28","doi-asserted-by":"publisher","unstructured":"Lamma, E., Mello, P., Riguzzi, F., & Storari, S. (2008). Applying inductive logic programming to process mining. In Proceedings of the 17th international conference on inductive logic programming, ILP 2007, no. 4894 in lecture notes in artificial intelligence (pp. 132\u2013146). Springer, Heidelberg, Germany. https:\/\/doi.org\/10.1007\/978-3-540-78469-2_16.","DOI":"10.1007\/978-3-540-78469-2_16"},{"key":"5911_CR29","doi-asserted-by":"crossref","unstructured":"Mihalkova, L., & Mooney, R.J. (2007). Bottom-up learning of Markov logic network structure. In Proceedings of the 24th International Conference on Machine Learning (pp. 625\u2013632). ACM.","DOI":"10.1145\/1273496.1273575"},{"key":"5911_CR30","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"},{"key":"5911_CR31","doi-asserted-by":"crossref","unstructured":"Neville, J., Jensen, D.D., Friedland, L., & Hay, M. (2003). Learning relational probability trees. In: L.\u00a0Getoor, T.E. Senator, P.M. Domingos, C.\u00a0Faloutsos (Eds.) Proceedings of the ninth ACM SIGKDD international conference on knowledge discovery and data mining, Washington, DC, USA, August 24\u201327, 2003, pp. 625\u2013630. ACM Press.","DOI":"10.1145\/956750.956830"},{"key":"5911_CR32","doi-asserted-by":"publisher","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.","DOI":"10.1007\/s10994-018-5750-0"},{"key":"5911_CR33","doi-asserted-by":"publisher","unstructured":"Nguembang Fadja, A., & Riguzzi, F. (2019). Lifted discriminative learning of probabilistic logic programs. Machine Learning, 108(7), 1111\u20131135. https:\/\/doi.org\/10.1007\/s10994-018-5750-0. http:\/\/ml.unife.it\/wp-content\/uploads\/Papers\/NguRig-ML18.pdf.","DOI":"10.1007\/s10994-018-5750-0"},{"issue":"151","key":"5911_CR34","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1090\/S0025-5718-1980-0572855-7","volume":"35","author":"J Nocedal","year":"1980","unstructured":"Nocedal, J. (1980). Updating Quasi-Newton matrices with limited storage. Mathematics of Computation, 35(151), 773\u2013782.","journal-title":"Mathematics of Computation"},{"issue":"3","key":"5911_CR35","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/BF03037184","volume":"11","author":"D Poole","year":"1993","unstructured":"Poole, D. (1993). Logic programming, abduction and probability: A top-down anytime algorithm for estimating prior and posterior probabilities. New Generat. Comput., 11(3), 377\u2013400.","journal-title":"New Generat. Comput."},{"key":"5911_CR36","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":"5911_CR37","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1613\/jair.1122","volume":"18","author":"D Poole","year":"2003","unstructured":"Poole, D., & Zhang, N. L. (2003). Exploiting contextual independence in probabilistic inference. Journal of Artificial Intelligence Research, 18, 263\u2013313.","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"3","key":"5911_CR38","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1023\/A:1007601015854","volume":"42","author":"FJ Provost","year":"2001","unstructured":"Provost, F. J., & Fawcett, T. (2001). Robust classification for imprecise environments. Machine Learning, 42(3), 203\u2013231.","journal-title":"Machine Learning"},{"issue":"1\u20132","key":"5911_CR39","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s10994-006-5833-1","volume":"62","author":"M Richardson","year":"2006","unstructured":"Richardson, M., & Domingos, P. (2006). Markov logic networks. Machine Learning, 62(1\u20132), 107\u2013136.","journal-title":"Machine Learning"},{"key":"5911_CR40","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":"2","key":"5911_CR41","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1017\/S1471068411000664","volume":"13","author":"F Riguzzi","year":"2013","unstructured":"Riguzzi, F., & Swift, T. (2013). Welldefinedness and efficient inference for probabilistic logic programming under the distribution semantics. Theory and Practice of Logic Programming, 13(2), 279\u2013302. https:\/\/doi.org\/10.1017\/S1471068411000664.","journal-title":"Theory and Practice of Logic Programming"},{"key":"5911_CR42","unstructured":"Sato, T. (1995). A statistical learning method for logic programs with distribution semantics. In: L.\u00a0Sterling (Ed.) ICLP 1995 (pp. 715\u2013729). Cambridge: MIT Press."},{"key":"5911_CR43","unstructured":"Sato, T., & Kameya, Y. (1997). PRISM: A language for symbolic-statistical modeling. In: IJCAI (Vol.\u00a097, pp. 1330\u20131339)."},{"key":"5911_CR44","unstructured":"Singla, P., & Domingos, P. (2005). Discriminative training of Markov logic networks. In: 20th national conference on artificial intelligence (AAAI 2005) (pp. 868\u2013873). AAAI Press\/The MIT Press."},{"key":"5911_CR45","doi-asserted-by":"publisher","unstructured":"Vennekens, J., Verbaeten, S., & Bruynooghe, M. (2004). Logic programs with annotated disjunctions. In: B.\u00a0Demoen, V.\u00a0Lifschitz (Eds.) ICLP 2004, lecture notes in computer science (vol. 3131, pp. 431\u2013445). Springer. https:\/\/doi.org\/10.1007\/978-3-540-27775-0_30","DOI":"10.1007\/978-3-540-27775-0_30"},{"issue":"1\u20132","key":"5911_CR46","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. https:\/\/doi.org\/10.1017\/S1471068411000494.","journal-title":"Theory and Practice of Logic Programming"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-020-05911-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10994-020-05911-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-020-05911-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,17]],"date-time":"2024-08-17T06:26:04Z","timestamp":1723875964000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10994-020-05911-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,10]]},"references-count":46,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,4]]}},"alternative-id":["5911"],"URL":"https:\/\/doi.org\/10.1007\/s10994-020-05911-6","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,11,10]]},"assertion":[{"value":"22 March 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 July 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 August 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 November 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}