{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T14:25:53Z","timestamp":1779287153736,"version":"3.51.4"},"reference-count":71,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,7,1]],"date-time":"2015-07-01T00:00:00Z","timestamp":1435708800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1007\/s10994-015-5510-3","type":"journal-article","created":{"date-parts":[[2015,7,15]],"date-time":"2015-07-15T10:21:37Z","timestamp":1436955697000},"page":"127-156","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Bandit-based Monte-Carlo structure learning of probabilistic logic programs"],"prefix":"10.1007","volume":"100","author":[{"given":"Nicola","family":"Di Mauro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elena","family":"Bellodi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabrizio","family":"Riguzzi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,7,16]]},"reference":[{"issue":"2\u20133","key":"5510_CR1","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1023\/A:1013689704352","volume":"47","author":"P Auer","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N., & Fischer, P. (2002). Finite-time analysis of the multiarmed bandit problem. Machine Learning, 47(2\u20133), 235\u2013256.","journal-title":"Machine Learning"},{"key":"5510_CR2","doi-asserted-by":"crossref","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., et al. (2005). Learning multiple evolutionary pathways from cross-sectional data. Journal of Computational Biology, 12, 584\u2013598.","journal-title":"Journal of Computational Biology"},{"key":"5510_CR3","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.). Inductive logic programming, LNCS, vol 7207 (pp. 61\u201375). Springer, Berlin, Heidelberg.","DOI":"10.1007\/978-3-642-31951-8_10"},{"issue":"2","key":"5510_CR4","doi-asserted-by":"crossref","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"},{"key":"5510_CR5","doi-asserted-by":"crossref","unstructured":"Bellodi, E., & Riguzzi, F. (2014). Structure learning of probabilistic logic programs by searching the clause space. Theory and Practice of Logic Programming FirstView Articles. doi: 10.1017\/S1471068413000689 .","DOI":"10.1017\/S1471068413000689"},{"issue":"9","key":"5510_CR6","doi-asserted-by":"crossref","first-page":"993","DOI":"10.1109\/12.537122","volume":"45","author":"B Bollig","year":"1996","unstructured":"Bollig, B., & Wegener, I. (1996). Improving the variable ordering of OBDDs is NP-complete. IEEE Transactions on Computers, 45(9), 993\u20131002.","journal-title":"IEEE Transactions on Computers"},{"issue":"1","key":"5510_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TCIAIG.2012.2186810","volume":"4","author":"C Browne","year":"2012","unstructured":"Browne, C., Powley, E. J., Whitehouse, D., Lucas, S. M., Cowling, P. I., Rohlfshagen, P., et al. (2012). A survey of Monte Carlo tree search methods. IEEE Transactions on Computational Intelligence and AI in Games, 4(1), 1\u201343.","journal-title":"IEEE Transactions on Computational Intelligence and AI in Games"},{"issue":"1","key":"5510_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/2200000024","volume":"5","author":"S Bubeck","year":"2012","unstructured":"Bubeck, S., & Cesa-Bianchi, N. (2012). Regret analysis of stochastic and nonstochastic multi-armed bandit problems. Foundations and Trends in Machine Learning, 5(1), 1\u2013122.","journal-title":"Foundations and Trends in Machine Learning"},{"key":"5510_CR9","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1613\/jair.989","volume":"17","author":"A Darwiche","year":"2002","unstructured":"Darwiche, A., & Marquis, P. (2002). A knowledge compilation map. Journal of Artificial Intelligence Research, 17, 229\u2013264.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"5510_CR10","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 (ICML-2006) machine learning, ACM (pp. 233\u2013240).","DOI":"10.1145\/1143844.1143874"},{"key":"5510_CR11","unstructured":"De Raedt, L., Kimmig, A., & Toivonen, H. (2007). ProbLog: A probabilistic Prolog and its application in link discovery. In: International joint conference on artificial intelligence (pp. 2462\u20132467). AAAI Press."},{"key":"5510_CR12","unstructured":"De Raedt, L., Demoen, B., Fierens, D., Gutmann, B., Janssens, G., & Kimmig, A. (2008a). Towards digesting the alphabet-soup of statistical relational learning. In: NIPS*2008 workshop on probabilistic programming."},{"issue":"2\u20133","key":"5510_CR13","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/s10994-007-5030-x","volume":"70","author":"L Raedt De","year":"2008","unstructured":"De Raedt, L., Kersting, K., Kimmig, A., Revoredo, K., & Toivonen, H. (2008b). Compressing probabilistic Prolog programs. Machine Learning, 70(2\u20133), 151\u2013168.","journal-title":"Machine Learning"},{"issue":"1","key":"5510_CR14","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1145\/1327452.1327492","volume":"51","author":"J Dean","year":"2008","unstructured":"Dean, J., & Ghemawat, S. (2008). Mapreduce: Simplified data processing on large clusters. Communication of the ACM, 51(1), 107\u2013113. doi: 10.1145\/1327452.1327492 .","journal-title":"Communication of the ACM"},{"issue":"1","key":"5510_CR15","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/s10994-009-5116-8","volume":"76","author":"A Duboc","year":"2009","unstructured":"Duboc, A., Paes, A., & Zaverucha, G. (2009). Using the bottom clause and mode declarations in fol theory revision from examples. Machine Learning, 76(1), 73\u2013107. doi: 10.1007\/s10994-009-5116-8 .","journal-title":"Machine Learning"},{"key":"5510_CR16","doi-asserted-by":"crossref","first-page":"861","DOI":"10.1016\/j.patrec.2005.10.010","volume":"27","author":"T Fawcett","year":"2006","unstructured":"Fawcett, T. (2006). An introduction to ROC analysis. Pattern Recognition Letters, 27, 861\u2013874.","journal-title":"Pattern Recognition Letters"},{"key":"5510_CR17","unstructured":"Fierens, D., den Broeck, G.V., Renkens, J., Shterionov, D.S., Gutmann, B., & Thon, I. et al. (2013). Inference and learning in probabilistic logic programs using weighted boolean formulas. In: Theory and practice of logic programming firstview articles (CoRR abs\/1304.6810)."},{"key":"5510_CR18","unstructured":"Friedman, N. (1998). The Bayesian structural EM algorithm. In: Proceedings of the 14th conference on uncertainty in artificial intelligence (pp. 129\u2013138). Morgan Kaufmann."},{"key":"5510_CR19","unstructured":"Gaudel, R., & Sebag, M. (2010). Feature selection as a one-player game. In: Proceedings of the 27th international conference on machine learning (pp. 359\u2013366)."},{"key":"5510_CR20","doi-asserted-by":"crossref","unstructured":"Gelly, S., & Silver, D. (2007). Combining online and offline knowledge in UCT. In: Proceedings of the 24th international conference on machine learning (pp. 273\u2013280). ACM.","DOI":"10.1145\/1273496.1273531"},{"key":"5510_CR21","unstructured":"Gelly, S., & Wang, Y. (2006). Exploration exploitation in Go: UCT for Monte-Carlo Go. In: NIPS on-line trading of exploration and exploitation workshop."},{"key":"5510_CR22","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1613\/jair.1096","volume":"18","author":"O Grumberg","year":"2003","unstructured":"Grumberg, O., Livne, S., & Markovitch, S. (2003). Learning to order BDD variables in verification. Journal of Artificial Intelligence Research, 18, 83\u2013116.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"5510_CR23","doi-asserted-by":"crossref","unstructured":"Gutmann, B., Thon, I., & De Raedt, L. (2011). Learning the parameters of probabilistic logic programs from interpretations. In: D. Gunopulos, T. Hofmann, D. Malerba, M. Vazirgiannis (Eds.). European conference on machine learning and knowledge discovery in databases, LNCS, vol 6911 (pp. 581\u2013596). Springer.","DOI":"10.1007\/978-3-642-23780-5_47"},{"key":"5510_CR24","volume-title":"Stochastic local search: Foundations & applications","author":"HH Hoos","year":"2004","unstructured":"Hoos, H. H., & St\u00fctzle, T. (2004). Stochastic local search: Foundations & applications. Amsterdam: Elsevier."},{"key":"5510_CR25","doi-asserted-by":"crossref","unstructured":"Huynh, T.N., & Mooney, R.J. (2008). Discriminative structure and parameter learning for markov logic networks. In: W.W. Cohen , A. McCallum, S.T. Roweis (Eds.). Proceedings of the 25th international conference on machine learning (pp. 416\u2013423). ACM.","DOI":"10.1145\/1390156.1390209"},{"key":"5510_CR26","doi-asserted-by":"crossref","unstructured":"Kersting, K., & De Raedt, L. (2008). Basic principles of learning Bayesian Logic Programs. In: Probabilistic inductive logic programming, LNCS, vol 4911 (189\u2013221). Springer.","DOI":"10.1007\/978-3-540-78652-8_7"},{"issue":"3","key":"5510_CR27","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/s10994-012-5307-6","volume":"89","author":"H Khosravi","year":"2012","unstructured":"Khosravi, H., Schulte, O., Hu, J., & Gao, T. (2012). Learning compact Markov logic Networks with decision trees. Machine Learning, 89(3), 257\u2013277.","journal-title":"Machine Learning"},{"key":"5510_CR28","doi-asserted-by":"crossref","unstructured":"Khot, T., Natarajan, S., Kersting, K., & Shavlik, J.W. (2011). Learning Markov Logic Networks via functional gradient boosting. In: Cook DJ, Pei J, W.W. 0010, O.R. Zaane, X. Wu (Eds.). Proceedings of the 11th IEEE international conference on data mining (pp. 320\u2013329).","DOI":"10.1109\/ICDM.2011.87"},{"key":"5510_CR29","doi-asserted-by":"crossref","unstructured":"Kocsis, L., & Szepesv\u00e1ri, C. (2006). Bandit based Monte-Carlo planning. In: Proceedings of the 17th European conference on machine learning (pp. 282\u2013293). Springer.","DOI":"10.1007\/11871842_29"},{"key":"5510_CR30","unstructured":"Kocsis, L., Szepesv\u00e1ri, C., & Willemson, J. (2006). Improved Monte-Carlo search. Tech. rep., Univ. Tartu, Estonia."},{"key":"5510_CR31","doi-asserted-by":"crossref","unstructured":"Kok, S., & Domingos, P. (2005). Learning the structure of Markov Logic Networks. In: Proceedings of the 22nd international conference on machine learning (pp. 441\u2013448). ACM.","DOI":"10.1145\/1102351.1102407"},{"key":"5510_CR32","unstructured":"Kok, S., & Domingos, P. (2010). Learning Markov Logic Networks using structural motifs. In: J. F\u00fcrnkranz, T. Joachims (Eds.). Proceedings of the 27th international conference on machine learning (pp. 551\u2013558). Omnipress."},{"key":"5510_CR33","doi-asserted-by":"crossref","unstructured":"Lowd, D., & Domingos, P. (2007). Efficient weight learning for Markov logic networks. In: Proceedings of the 11th European conference on principles and practice of knowledge discovery in databases (pp. 200\u2013211). Springer.","DOI":"10.1007\/978-3-540-74976-9_21"},{"key":"5510_CR34","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-1665-5_9","volume-title":"Advanced multi-start methods","author":"R Mart\u00ed","year":"2010","unstructured":"Mart\u00ed, R., Moreno, J. M., & Duarte, A. (2010). Advanced multi-start methods. Berlin: Springer."},{"key":"5510_CR35","unstructured":"May, W. (1999). Information extraction and integration: The mondial case study. Tech. rep., Universitat Freiburg, Institut f\u00fcr Informatik."},{"issue":"1","key":"5510_CR36","first-page":"131","volume":"89","author":"W Meert","year":"2008","unstructured":"Meert, W., Struyf, J., & Blockeel, H. (2008). Learning ground CP-Logic theories by leveraging Bayesian network learning techniques. Fundamenta Informaticae, 89(1), 131\u2013160.","journal-title":"Fundamenta Informaticae"},{"key":"5510_CR37","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":"5510_CR38","doi-asserted-by":"crossref","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":"5510_CR39","doi-asserted-by":"crossref","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":"5510_CR40","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-62927-0","volume-title":"Foundations of inductive logic programming, LNCS","author":"SH Nienhuys-Cheng","year":"1997","unstructured":"Nienhuys-Cheng, S. H., & de Wolf, R. (1997). Foundations of inductive logic programming, LNCS. Berlin: Springer."},{"key":"5510_CR41","doi-asserted-by":"crossref","unstructured":"Paes, A., Revoredo, K., Zaverucha, G., & Costa, V.S. (2005). Probabilistic first-order theory revision from examples. In: Proceedings of the 15th international conference on inductive logic programming, LNCS, vol 3625 (pp. 295\u2013311). Springer. doi: 10.1007\/11536314_18 .","DOI":"10.1007\/11536314_18"},{"key":"5510_CR42","doi-asserted-by":"crossref","unstructured":"Paes, A., Zaverucha, G., & Costa, V.S. (2008). Revising first-order logic theories from examples through stochastic local search. In: Proceedings of the 17th international conference on inductive logic programming, ILP\u201907 (pp. 200\u2013210). Springer, Berlin, Heidelberg. http:\/\/dl.acm.org\/citation.cfm?id=1793494.1793518","DOI":"10.1007\/978-3-540-78469-2_21"},{"key":"5510_CR43","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1007\/978-3-540-78652-8_8","volume-title":"Probabilistic inductive logic programming, LNCS","author":"D Poole","year":"2008","unstructured":"Poole, D. (2008). The independent choice logic and beyond. In L. De Raedt, P. Frasconi, K. Kersting, & S. Muggleton (Eds.), Probabilistic inductive logic programming, LNCS (Vol. 4911, pp. 222\u2013243). Berlin, Heidelberg: Springer."},{"issue":"1","key":"5510_CR44","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/S0951-8320(02)00165-5","volume":"79","author":"A Rauzy","year":"2003","unstructured":"Rauzy, A., Ch\u00e2telet, E., Dutuit, Y., & B\u00e9renguer, C. (2003). A practical comparison of methods to assess sum-of-products. Reliability Engineering and System Safety, 79(1), 33\u201342.","journal-title":"Reliability Engineering and System Safety"},{"issue":"2","key":"5510_CR45","first-page":"95","volume":"19","author":"BL Richards","year":"1995","unstructured":"Richards, B. L., & Mooney, R. J. (1995). Automated refinement of first-order horn-clause domain theories. Machine Learning, 19(2), 95\u2013131. doi: 10.1007\/BF01007461 .","journal-title":"Machine Learning"},{"key":"5510_CR46","doi-asserted-by":"crossref","unstructured":"Riguzzi, F. (2004). Learning logic programs with annotated disjunctions. In: A. Srinivasan, R. King (Eds.). Proceedings of the 14th international conference on inductive logic programming, LNCS, vol. 3194 (pp. 270\u2013287). Springer. doi: 10.1007\/978-3-540-30109-7_21 .","DOI":"10.1007\/978-3-540-30109-7_21"},{"key":"5510_CR47","doi-asserted-by":"crossref","unstructured":"Riguzzi, F. (2007a). ALLPAD: Approximate learning of logic programs with annotated disjunctions. In: S. Muggleton, R. Otero (Eds.). Proceedings of the 16th international conference on inductive logic programming, LNAI, vol. 4455 (pp. 43\u201345). Springer. doi: 10.1007\/978-3-540-73847-3_11 .","DOI":"10.1007\/978-3-540-73847-3_11"},{"key":"5510_CR48","doi-asserted-by":"crossref","unstructured":"Riguzzi, F. (2007b). A top down interpreter for LPAD and CPlogic. In: Proceedings of the 10th congress of the Italian association for artificial intelligence, LNAI, vol. 4733 (pp. 109\u2013120). Springer. doi: 10.1007\/978-3-540-74782-6_11 .","DOI":"10.1007\/978-3-540-74782-6_11"},{"issue":"2\u20133","key":"5510_CR49","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/s10994-007-5032-8","volume":"70","author":"F Riguzzi","year":"2008","unstructured":"Riguzzi, F. (2008). ALLPAD: Approximate learning of logic programs with annotated disjunctions. Machine Learning, 70(2\u20133), 207\u2013223. doi: 10.1007\/s10994-007-5032-8 .","journal-title":"Machine Learning"},{"issue":"6","key":"5510_CR50","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1093\/jigpal\/jzp025","volume":"17","author":"F Riguzzi","year":"2009","unstructured":"Riguzzi, F. (2009). Extended semantics and inference for the Independent Choice Logic. Logic Journal of the IGPL, 17(6), 589\u2013629. doi: 10.1093\/jigpal\/jzp025 .","journal-title":"Logic Journal of the IGPL"},{"issue":"3","key":"5510_CR51","doi-asserted-by":"crossref","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. The Computer Journal, 57(3), 347\u2013363. doi: 10.1093\/comjnl\/bxt096 .","journal-title":"The Computer Journal"},{"issue":"1","key":"5510_CR52","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/s10994-011-5247-6","volume":"86","author":"F Riguzzi","year":"2012","unstructured":"Riguzzi, F., & Di Mauro, N. (2012). Applying the information bottleneck to statistical relational learning. Machine Learning, 86(1), 89\u2013114. doi: 10.1007\/s10994-011-5247-6 .","journal-title":"Machine Learning"},{"key":"5510_CR53","unstructured":"Riguzzi, F., & Swift, T. (2010). Tabling and Answer Subsumption for Reasoning on Logic Programs with Annotated Disjunctions. In: Technical communications of the 26th int\u2019l. conference on logic programming (ICLP\u201910), Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Leibniz international proceedings in informatics (LIPIcs), vol. 7 (pp. 162\u2013171). doi: 10.4230\/LIPIcs.ICLP.2010.162 ."},{"key":"5510_CR54","doi-asserted-by":"crossref","unstructured":"Riguzzi, F., & Swift, T. (2011). The PITA system: Tabling and answer subsumption for reasoning under uncertainty. In: Theory and practice of logic programming, 27th international conference on logic programming (ICLP\u201911) special issue, Lexington, Kentucky 6\u201310 July 2011 11(4\u20135), 433\u2013449. doi: 10.1017\/S147106841100010X .","DOI":"10.1017\/S147106841100010X"},{"key":"5510_CR55","doi-asserted-by":"crossref","unstructured":"Riguzzi, F., & Swift, T. (2013). Welldefinedness and efficient inference for probabilistic logic programming under the distribution semantics. In: Theory and practice of logic programming 13 (Special Issue 02\u201325th Annual GULP Conference) (pp. 279\u2013302). doi: 10.1017\/S1471068411000664 .","DOI":"10.1017\/S1471068411000664"},{"key":"5510_CR56","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1090\/S0002-9904-1952-09620-8","volume":"58","author":"H Robbins","year":"1952","unstructured":"Robbins, H. (1952). Some aspects of the sequential design of experiments. Bulletin of the American Mathematics Society, 58, 527\u2013535.","journal-title":"Bulletin of the American Mathematics Society"},{"key":"5510_CR57","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1007\/978-3-642-04174-7_20","volume-title":"Proceedingf of the European conference on machine learning and knowledge discovery in databases, LNCS","author":"P Rolet","year":"2009","unstructured":"Rolet, P., Sebag, M., & Teytaud, O. (2009). Boosting active learning to optimality: A tractable Monte-Carlo, billiard-based algorithm. In W. Buntine, M. Grobelnik, D. Mladeni, & J. Shawe-Taylor (Eds.), Proceedingf of the European conference on machine learning and knowledge discovery in databases, LNCS (Vol. 5782, pp. 302\u2013317). Berlin, Heidelberg: Springer."},{"issue":"1","key":"5510_CR58","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1162\/neco.1997.9.1.99","volume":"9","author":"P Rujan","year":"1997","unstructured":"Rujan, P. (1997). Playing billiards in version space. Neural Computation, 9(1), 99\u2013122.","journal-title":"Neural Computation"},{"key":"5510_CR59","first-page":"475","volume-title":"National conference on artificial intelligence","author":"T Sang","year":"2005","unstructured":"Sang, T., Beame, P., & Kautz, H. A. (2005). Performing bayesian inference by weighted model counting. In M. M. Veloso & S. Kambhampati (Eds.), National conference on artificial intelligence (pp. 475\u2013482). Cambridge: AAAI Press \/ The MIT Press."},{"issue":"1\u20132","key":"5510_CR60","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1017\/S1471068411000512","volume":"12","author":"V Santos Costa","year":"2012","unstructured":"Santos Costa, V., Rocha, R., & Damas, L. (2012). The YAP Prolog system. Theory and Practice of Logic Programming, 12(1\u20132), 5\u201334.","journal-title":"Theory and Practice of Logic Programming"},{"key":"5510_CR61","unstructured":"Sato, T. (1995). A statistical learning method for logic programs with distribution semantics. In: International conference on logic programming (pp. 715\u2013729). MIT Press."},{"issue":"2","key":"5510_CR62","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s10844-008-0062-7","volume":"31","author":"T Sato","year":"2008","unstructured":"Sato, T. (2008). A glimpse of symbolic-statistical modeling by PRISM. Journal of Intelligent Information Systems, 31(2), 161\u2013176.","journal-title":"Journal of Intelligent Information Systems"},{"key":"5510_CR63","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1613\/jair.912","volume":"15","author":"T Sato","year":"2001","unstructured":"Sato, T., & Kameya, Y. (2001). Parameter learning of logic programs for symbolic-statistical modeling. Journal of Artificial Intelligence Research, 15, 391\u2013454.","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"3","key":"5510_CR64","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/s10994-012-5289-4","volume":"88","author":"O Schulte","year":"2012","unstructured":"Schulte, O., & Khosravi, H. (2012). Learning graphical models for relational data via lattice search. Machine Learning, 88(3), 331\u2013368.","journal-title":"Machine Learning"},{"issue":"2","key":"5510_CR65","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1214\/aos\/1176344136","volume":"6","author":"G Schwarz","year":"1978","unstructured":"Schwarz, G. (1978). Estimating the dimension of a model. The Annals of Statistics, 6(2), 461\u2013464.","journal-title":"The Annals of Statistics"},{"key":"5510_CR66","unstructured":"Srinivasan, A. (2012). Aleph. http:\/\/www.cs.ox.ac.uk\/activities\/machlearn\/Aleph\/aleph.html ."},{"issue":"1\u20132","key":"5510_CR67","first-page":"277","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. AI, 85(1\u20132), 277\u2013299.","journal-title":"AI"},{"key":"5510_CR68","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. Dzeroski (Eds.), 7th International workshop on inductive logic programming, LNCS (pp. 273\u2013287). Springer.","DOI":"10.1007\/3540635149_56"},{"key":"5510_CR69","doi-asserted-by":"crossref","unstructured":"Vennekens, J., Verbaeten, S., & Bruynooghe, M. (2004). Logic programs with annotated disjunctions. International conference on logic programming, LNCS, vol. 3131 (pp. 195\u2013209). Springer.","DOI":"10.1007\/978-3-540-27775-0_30"},{"key":"5510_CR70","unstructured":"\u017delezn\u00fd, F., Srinivasan, A., & Page, C.D. (2002). Lattice-search runtime distributions may be heavy-tailed. In: Proceedings of the 12th international conference on inductive logic programming, Springer."},{"issue":"1\u20133","key":"5510_CR71","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/s10994-006-7733-9","volume":"64","author":"F Zelezn\u00fd","year":"2006","unstructured":"Zelezn\u00fd, F., Srinivasan, A., & Page, C. D, Jr. (2006). Randomised restarted search in ILP. Machine Learning, 64(1\u20133), 183\u2013208.","journal-title":"Machine Learning"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-015-5510-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-015-5510-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-015-5510-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,28]],"date-time":"2019-08-28T03:59:59Z","timestamp":1566964799000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-015-5510-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7]]},"references-count":71,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,7]]}},"alternative-id":["5510"],"URL":"https:\/\/doi.org\/10.1007\/s10994-015-5510-3","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7]]}}}