{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:32:08Z","timestamp":1740123128747,"version":"3.37.3"},"reference-count":71,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2019,11,18]],"date-time":"2019-11-18T00:00:00Z","timestamp":1574035200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,11,18]],"date-time":"2019-11-18T00:00:00Z","timestamp":1574035200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000769","name":"University of Oxford","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100000769","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2020,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>General game playing (GGP) is a framework for evaluating an agent\u2019s general intelligence across a wide range of tasks. In the GGP competition, an agent is given the rules of a game (described as a logic program) that it has never seen before. The task is for the agent to play the game, thus generating game traces. The winner of the GGP competition is the agent that gets the best total score over all the games. In this paper, we invert this task: a learner is given game traces and the task is to learn the rules that could produce the traces. This problem is central to<jats:italic>inductive general game playing<\/jats:italic>(IGGP). We introduce a technique that automatically generates IGGP tasks from GGP games. We introduce an IGGP dataset which contains traces from 50 diverse games, such as<jats:italic>Sudoku<\/jats:italic>,<jats:italic>Sokoban<\/jats:italic>, and<jats:italic>Checkers<\/jats:italic>. We claim that IGGP is difficult for existing inductive logic programming (ILP) approaches. To support this claim, we evaluate existing ILP systems on our dataset. Our empirical results show that most of the games cannot be correctly learned by existing systems. The best performing system solves only 40% of the tasks perfectly. Our results suggest that IGGP poses many challenges to existing approaches. Furthermore, because we can automatically generate IGGP tasks from GGP games, our dataset will continue to grow with the GGP competition, as new games are added every year. We therefore think that the IGGP problem and dataset will be valuable for motivating and evaluating future research.<\/jats:p>","DOI":"10.1007\/s10994-019-05843-w","type":"journal-article","created":{"date-parts":[[2019,11,18]],"date-time":"2019-11-18T22:01:31Z","timestamp":1574114491000},"page":"1393-1434","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Inductive general game playing"],"prefix":"10.1007","volume":"109","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4543-7199","authenticated-orcid":false,"given":"Andrew","family":"Cropper","sequence":"first","affiliation":[]},{"given":"Richard","family":"Evans","sequence":"additional","affiliation":[]},{"given":"Mark","family":"Law","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,18]]},"reference":[{"key":"5843_CR1","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/B978-0-934613-40-8.50006-3","volume-title":"Foundations of deductive databases and logic programming","author":"KR Apt","year":"1988","unstructured":"Apt, K. R., Blair, H. A., & Walker, A. (1988). Towards a theory of declarative knowledge. In J. Minker (Ed.), Foundations of deductive databases and logic programming (pp. 89\u2013148). Burlinton: Morgan Kaufmann."},{"key":"5843_CR2","unstructured":"Bain, M. (1994). Learning logical exceptions in chess. Ph.D. thesis, University of Strathclyde"},{"issue":"02","key":"5843_CR3","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(02), 169\u2013212.","journal-title":"Theory and Practice of Logic Programming"},{"key":"5843_CR4","unstructured":"Bj\u00f6rnsson, Y. (2012). Learning rules of simplified boardgames by observing. In ECAI (pp. 175\u2013180)."},{"key":"5843_CR5","doi-asserted-by":"crossref","unstructured":"Brodersen, K. H., Ong, C.\u00a0S., Stephan, K.\u00a0E., & Buhmann, J.\u00a0M. (2010). The balanced accuracy and its posterior distribution. In 20th international conference on pattern recognition (ICPR 2010), Istanbul, Turkey, 23\u201326 August 2010 (pp. 3121\u20133124). IEEE Computer Society.","DOI":"10.1109\/ICPR.2010.764"},{"issue":"1\u20132","key":"5843_CR6","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0004-3702(01)00129-1","volume":"134","author":"M Campbell","year":"2002","unstructured":"Campbell, M., Joseph\u00a0Hoane, A, Jr., & Hsu, F. (2002). Deep blue. Artificial Intelligence, 134(1\u20132), 57\u201383.","journal-title":"Artificial Intelligence"},{"key":"5843_CR7","unstructured":"Castillo, L. P., & Wrobel, S. (2003). Learning minesweeper with multirelational learning. In IJCAI (pp. 533\u2013540). Morgan Kaufmann."},{"key":"5843_CR8","unstructured":"Corapi, D., Russo, A., & Lupu, E. (2011). Inductive logic programming in answer set programming. In International conference on inductive logic programming (pp. 91\u201397). Springer."},{"issue":"1\u20132","key":"5843_CR9","first-page":"5","volume":"12","author":"VS Costa","year":"2012","unstructured":"Costa, V. S., Rocha, R., & Damas, L. (2012). The YAP prolog system. TPLP, 12(1\u20132), 5\u201334.","journal-title":"TPLP"},{"key":"5843_CR10","doi-asserted-by":"crossref","unstructured":"Cresswell, S., McCluskey, T. L., & West, M. M. (2009). Acquisition of object-centred domain models from planning examples. In ICAPS.","DOI":"10.1609\/icaps.v19i1.13391"},{"key":"5843_CR11","unstructured":"Cropper, A. (2017). Efficiently learning efficient programs. Ph.D. thesis, Imperial College London, UK."},{"key":"5843_CR12","unstructured":"Cropper, A., & Muggleton, S. H. (2014). Logical minimisation of meta-rules within meta-interpretive learning. In J. Davis, & J. Ramon, (Eds.), Inductive logic programming\u201424th international conference (ILP 2014), Nancy, France, September 14\u201316, 2014, revised selected papers, volume 9046 of Lecture Notes in Computer Science (pp. 62\u201375). Springer."},{"key":"5843_CR13","unstructured":"Cropper, A., & Muggleton, S.\u00a0H. (2016a). Learning higher-order logic programs through abstraction and invention. In S. Kambhampati (Ed.), Proceedings of the twenty-fifth international joint conference on artificial intelligence (IJCAI 2016), New York, NY, USA, 9\u201315 July 2016 (pp. 1418\u20131424). IJCAI\/AAAI Press."},{"key":"5843_CR14","unstructured":"Cropper, A. & Muggleton, S.\u00a0H. (2016b). Metagol system. https:\/\/github.com\/metagol\/metagol."},{"issue":"7","key":"5843_CR15","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.","journal-title":"Machine Learning"},{"key":"5843_CR16","doi-asserted-by":"crossref","unstructured":"Cropper, A., & Tourret, S. (2018). Derivation reduction of metarules in meta-interpretive learning. In ILP, volume 11105 of Lecture Notes in Computer Science (pp. 1\u201321). Springer.","DOI":"10.1007\/978-3-319-99960-9_1"},{"key":"5843_CR17","unstructured":"Cropper, A., & Tourret, S. (2019). Logical minimisation of metarules. Machine Learning (to appear). arXiv:1907.10952."},{"issue":"3","key":"5843_CR18","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/502807.502810","volume":"33","author":"E Dantsin","year":"2001","unstructured":"Dantsin, E., Eiter, T., Gottlob, G., & Voronkov, A. (2001). Complexity and expressive power of logic programming. ACM Computing Surveys (CSUR), 33(3), 374\u2013425.","journal-title":"ACM Computing Surveys (CSUR)"},{"key":"5843_CR19","doi-asserted-by":"crossref","unstructured":"De Raedt, L. (2008). Logical and relational learning. In Cognitive technologies. Springer.","DOI":"10.1007\/978-3-540-68856-3"},{"key":"5843_CR20","first-page":"2462","volume":"7","author":"LD De Raedt","year":"2007","unstructured":"De Raedt, L. D., Kimmig, A., & Toivonen, H. (2007). Problog: A probabilistic prolog and its application in link discovery. IJCAI, 7, 2462\u20132467.","journal-title":"IJCAI"},{"key":"5843_CR21","doi-asserted-by":"crossref","unstructured":"De\u00a0Raedt, L., & Thon, I. (2010). Probabilistic rule learning. In International conference on inductive logic programming (pp. 47\u201358). Springer.","DOI":"10.1007\/978-3-642-13840-9"},{"issue":"2","key":"5843_CR22","doi-asserted-by":"publisher","first-page":"786","DOI":"10.1021\/jm00106a046","volume":"34","author":"AK Debnath","year":"1991","unstructured":"Debnath, A. K., Lopez\u00a0de Compadre, R. L., Debnath, G., Shusterman, A. J., & Hansch, C. (1991). Structure-activity relationship of mutagenic aromatic and heteroaromatic nitro compounds. Correlation with molecular orbital energies and hydrophobicity. Journal of Medicinal Chemistry, 34(2), 786\u2013797.","journal-title":"Journal of Medicinal Chemistry"},{"key":"5843_CR23","unstructured":"Duff, M. \u00a0O., & Barto, A. (2002). Optimal learning: Computational procedures for Bayes-adaptive Markov decision processes. Ph.D. thesis, University of Massachusetts at Amherst."},{"issue":"1\u20132","key":"5843_CR24","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1007694015589","volume":"43","author":"S D\u017eeroski","year":"2001","unstructured":"D\u017eeroski, S., De Raedt, L., & Driessens, K. (2001). Relational reinforcement learning. Machine learning, 43(1\u20132), 7\u201352.","journal-title":"Machine learning"},{"key":"5843_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1613\/jair.5714","volume":"61","author":"R Evans","year":"2018","unstructured":"Evans, R., & Grefenstette, E. (2018). Learning explanatory rules from noisy data. Journal of Artificial Intelligence, 61, 1\u201364.","journal-title":"Journal of Artificial Intelligence"},{"key":"5843_CR26","unstructured":"Finnsson, H., et al. (2012). Simulation-based general game playing. Doctor of philosophy, School of Computer Science, Reykjav\u00edk University."},{"key":"5843_CR27","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., & Schaub, T. (2014). Clingo = ASP + control: Preliminary report. CoRR. arXiv:1405.3694."},{"issue":"2","key":"5843_CR28","doi-asserted-by":"publisher","first-page":"107","DOI":"10.3233\/AIC-2011-0491","volume":"24","author":"M Gebser","year":"2011","unstructured":"Gebser, M., Kaufmann, B., Kaminski, R., Ostrowski, M., Schaub, T., & Schneider, M. (2011). Potassco: The potsdam answer set solving collection. Ai Communications, 24(2), 107\u2013124.","journal-title":"Ai Communications"},{"issue":"2","key":"5843_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2200\/S00564ED1V01Y201311AIM024","volume":"8","author":"M Genesereth","year":"2014","unstructured":"Genesereth, M., & Thielscher, M. (2014). General game playing. Synthesis Lectures on Artificial Intelligence and Machine Learning, 8(2), 1\u2013229.","journal-title":"Synthesis Lectures on Artificial Intelligence and Machine Learning"},{"issue":"2","key":"5843_CR30","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1609\/aimag.v34i2.2475","volume":"34","author":"MR Genesereth","year":"2013","unstructured":"Genesereth, M. R., & Bj\u00f6rnsson, Y. (2013). The international general game playing competition. AI Magazine, 34(2), 107\u2013111.","journal-title":"AI Magazine"},{"key":"5843_CR31","unstructured":"Goodacre, J. (1996). Inductive learning of chess rules using Progol. Ph.D. thesis, University of Oxford."},{"key":"5843_CR32","unstructured":"Gregory, P., Schumann, H. C., Yngvi, B., & Schiffel, S. (2015). The GRL system: Learning board game rules with piece-move interactions. In Computer games (pp. 130\u2013148). Springer."},{"key":"5843_CR33","doi-asserted-by":"crossref","unstructured":"Grohe, M., & Ritzert, M.(2017). Learning first-order definable concepts over structures of small degree. In 2017 32nd annual ACM\/IEEE symposium on logic in computer science (LICS) (pp. 1\u201312). IEEE.","DOI":"10.1109\/LICS.2017.8005080"},{"key":"5843_CR34","unstructured":"Guez, A., Silver, D., & Dayan, P. (2012). Efficient bayes-adaptive reinforcement learning using sample-based search. In Advances in neural information processing systems (pp. 1025\u20131033)."},{"key":"5843_CR35","unstructured":"Hinton, G.\u00a0E. (1986). Learning distributed representations of concepts. In Proceedings of the eighth annual conference of the cognitive science society (Vol.\u00a01, p. 12). Amherst, MA."},{"issue":"2","key":"5843_CR36","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s10994-013-5341-z","volume":"91","author":"K Inoue","year":"2013","unstructured":"Inoue, K., Doncescu, A., & Nabeshima, H. (2013). Completing causal networks by meta-level abduction. Machine Learning, 91(2), 239\u2013277.","journal-title":"Machine Learning"},{"issue":"1","key":"5843_CR37","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1609\/aimag.v33i1.2395","volume":"33","author":"M J\u00e4rvisalo","year":"2012","unstructured":"J\u00e4rvisalo, M., Le Berre, D., Roussel, O., & Simon, L. (2012). The international SAT solver competitions. AI Magazine, 33(1), 89\u201392.","journal-title":"AI Magazine"},{"key":"5843_CR38","unstructured":"Kaiser, L. (2012). Learning games from videos guided by descriptive complexity. In AAAI."},{"issue":"3\u20134","key":"5843_CR39","first-page":"571","volume":"18","author":"T Kaminski","year":"2018","unstructured":"Kaminski, T., Eiter, T., & Inoue, K. (2018). Exploiting answer set programming with external sources for meta-interpretive learning. TPLP, 18(3\u20134), 571\u2013588.","journal-title":"TPLP"},{"key":"5843_CR40","unstructured":"Kearns, M.\u00a0J., & Singh, S.\u00a0P. (1999) Finite-sample convergence rates for q-learning and indirect algorithms. In Advances in neural information processing systems (pp. 996\u20131002)."},{"key":"5843_CR41","unstructured":"Koriche, F., Lagrue, S., Piette, \u00c9., & Tabary, S. (2016). Stochastic constraint programming for general game playing with imperfect information. In General intelligence in game-playing agents (GIGA\u201916) at the 25th international joint conference on artificial intelligence (IJCAI\u201916), pages."},{"key":"5843_CR42","first-page":"336","volume":"307","author":"F Koriche","year":"2017","unstructured":"Koriche, F., Lagrue, S., Piette, \u00c9., & Tabary, S. (2017). Woodstock: un programme-joueur g\u00e9n\u00e9rique dirig\u00e9 par les contraintes stochastiques. Revue d\u2019intelligence artificielle\u2013no, 307, 336.","journal-title":"Revue d\u2019intelligence artificielle\u2013no"},{"key":"5843_CR43","first-page":"38","volume":"63","author":"J Larson","year":"1977","unstructured":"Larson, J., & Michalski, R. S. (1977). Inductive inference of VL decision rules. SIGART Newsletter, 63, 38\u201344.","journal-title":"SIGART Newsletter"},{"key":"5843_CR44","unstructured":"Law, M. (2018). Inductive learning of answer set programs. Ph.D. thesis, Imperial College London, UK."},{"key":"5843_CR45","doi-asserted-by":"crossref","unstructured":"Law, M., Russo, A., & Broda, K. (2014). Inductive learning of answer set programs. In Logics in artificial intelligence\u201414th European conference (JELIA 2014) Funchal, Madeira, Portugal, September 24\u201326, 2014. Proceedings (pp. 311\u2013325).","DOI":"10.1007\/978-3-319-11558-0_22"},{"key":"5843_CR46","unstructured":"Law, M., Russo, A., & Broda, K. (2015a). The ILASP system for learning answer set programs. https:\/\/www.doc.ic.ac.uk\/~ml1909\/ILASP."},{"issue":"4\u20135","key":"5843_CR47","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1017\/S1471068415000198","volume":"15","author":"M Law","year":"2015","unstructured":"Law, M., Russo, A., & Broda, K. (2015). Learning weak constraints in answer set programming. Theory and Practice of Logic Programming, 15(4\u20135), 511\u2013525.","journal-title":"Theory and Practice of Logic Programming"},{"issue":"5\u20136","key":"5843_CR48","doi-asserted-by":"publisher","first-page":"834","DOI":"10.1017\/S1471068416000351","volume":"16","author":"M Law","year":"2016","unstructured":"Law, M., Russo, A., & Broda, K. (2016). Iterative learning of answer set programs from context dependent examples. Theory and Practice of Logic Programming, 16(5\u20136), 834\u2013848.","journal-title":"Theory and Practice of Logic Programming"},{"key":"5843_CR49","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.artint.2018.03.005","volume":"259","author":"M Law","year":"2018","unstructured":"Law, M., Russo, A., & Broda, K. (2018). The complexity and generality of learning answer set programs. Artificial Intelligence, 259, 110\u2013146.","journal-title":"Artificial Intelligence"},{"key":"5843_CR50","unstructured":"Law, Mark, Russo, Alessandra, & Broda, Krysia (2018). Inductive learning of answer set programs from noisy examples. Advances in Cognitive Systems."},{"key":"5843_CR51","unstructured":"Law, M., Russo, A., Cussens, J., & Broda, K. (2016). The 2016 competition on inductive logic programming. http:\/\/ilp16.doc.ic.ac.uk\/competition\/"},{"key":"5843_CR52","unstructured":"Lifschitz, V. (2008). What is answer set programming? In Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence (AAAI 2008), Chicago, Illinois, USA, July 13\u201317, 2008 (pp. 1594\u20131597). The AAAI Press: California."},{"key":"5843_CR53","unstructured":"Lin, D., Dechter, E., Ellis, K., Tenenbaum, J.\u00a0B., & Muggleton, S. (2014). Bias reformulation for one-shot function induction. In T. Schaub, G. Friedrich, & B. O\u2019Sullivan (Eds.), ECAI 2014\u201421st European conference on artificial intelligence, 18\u201322 August 2014, Prague, Czech Republic\u2014including prestigious applications of intelligent systems (PAIS 2014), volume 263 of Frontiers in Artificial Intelligence and Applications (pp. 525\u2013530). IOS Press."},{"key":"5843_CR54","doi-asserted-by":"crossref","unstructured":"Littman, M.\u00a0L. (1994). Markov games as a framework for multi-agent reinforcement learning. In Machine learning proceedings 1994 (pp. 157\u2013163). Elsevier.","DOI":"10.1016\/B978-1-55860-335-6.50027-1"},{"key":"5843_CR55","unstructured":"Love, N., Hinrichs, T., Haley, D., Schkufza, E. & Genesereth, M. (2008). General game playing: Game description language specification. Stanford Logic Group Computer Science Department Stanford University, technical report LG-2006-01."},{"key":"5843_CR56","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1111\/j.1467-8640.1996.tb00253.x","volume":"12","author":"EM Morales","year":"1996","unstructured":"Morales, E. M. (1996). Learning playing strategies in chess. Computational Intelligence, 12, 65\u201387.","journal-title":"Computational Intelligence"},{"issue":"3&4","key":"5843_CR57","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(3&4), 245\u2013286.","journal-title":"New Generation Computing"},{"key":"5843_CR58","doi-asserted-by":"crossref","unstructured":"Muggleton, S., Bain, M., Michie, J.\u00a0H., & Michie, D. (1989). An experimental comparison of human and machine learning formalisms. In A.\u00a0Maria Segre (Ed.), Proceedings of the sixth international workshop on machine learning (ML 1989), Cornell University, Ithaca, New York, USA, June 26\u201327, 1989 (pp. 113\u2013118). Morgan Kaufmann.","DOI":"10.1016\/B978-1-55860-036-2.50037-0"},{"issue":"1","key":"5843_CR59","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10994-011-5259-2","volume":"86","author":"S Muggleton","year":"2012","unstructured":"Muggleton, S., De Raedt, L., Poole, D., Bratko, I., Flach, P. A., Inoue, K., et al. (2012). ILP turns 20 - biography and future challenges. Machine Learning, 86(1), 3\u201323.","journal-title":"Machine Learning"},{"issue":"1","key":"5843_CR60","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10994-013-5358-3","volume":"94","author":"SH Muggleton","year":"2014","unstructured":"Muggleton, S. H., Lin, D., Pahlavi, N., & Tamaddoni-Nezhad, A. (2014). Meta-interpretive learning: application to grammatical inference. Machine Learning, 94(1), 25\u201349.","journal-title":"Machine Learning"},{"issue":"1","key":"5843_CR61","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10994-014-5471-y","volume":"100","author":"SH Muggleton","year":"2015","unstructured":"Muggleton, S. H., Lin, D., & Tamaddoni-Nezhad, A. (2015). Meta-interpretive learning of higher-order dyadic datalog: predicate invention revisited. Machine Learning, 100(1), 49\u201373.","journal-title":"Machine Learning"},{"key":"5843_CR62","unstructured":"Muggleton, S., Paes, A., Costa, V.\u00a0S., & Zaverucha, G. (2009). Chess revision: Acquiring the rules of chess variants through FOL theory revision from examples. In L. De Raedt (Ed.), Inductive logic programming, 19th international conference (ILP 2009), Leuven, Belgium, July 02\u201304, 2009. revised papers, volume 5989 of Lecture Notes in Computer Science (pp. 123\u2013130). Springer."},{"key":"5843_CR63","unstructured":"Oblak, A., & Bratko, I. (2010). Learning from noisy data using a non-covering ILP algorithm. In International conference on inductive logic programming (pp. 190\u2013197). Springer."},{"key":"5843_CR64","doi-asserted-by":"crossref","unstructured":"Otero, R. P. (2001). Induction of stable models. In Inductive logic programming (pp. 193\u2013205). Springer.","DOI":"10.1007\/3-540-44797-0_16"},{"key":"5843_CR65","first-page":"239","volume":"5","author":"J Ross Quinlan","year":"1990","unstructured":"Ross Quinlan, J. (1990). Learning logical definitions from relations. Machine Learning, 5, 239\u2013266.","journal-title":"Machine Learning"},{"key":"5843_CR66","doi-asserted-by":"publisher","first-page":"6","DOI":"10.3389\/frobt.2014.00006","volume":"1","author":"F Riguzzi","year":"2014","unstructured":"Riguzzi, F., Bellodi, E., & Zese, R. (2014). A history of probabilistic inductive logic programming. Frontiers in Robotics and AI, 1, 6.","journal-title":"Frontiers in Robotics and AI"},{"key":"5843_CR67","unstructured":"Riguzzi, F., Bellodi, E., Zese, R., Cota, G., & Lamma, E. (2016). Scaling structure learning of probabilistic logic programs by mapreduce. In European Conference on Artificial Intelligence."},{"issue":"1","key":"5843_CR68","first-page":"21","volume":"17","author":"J Schaeffer","year":"1996","unstructured":"Schaeffer, J., Lake, R., Paul, L., & Bryant, M. (1996). CHINOOK: the world man-machine checkers champion. AI Magazine, 17(1), 21\u201329.","journal-title":"AI Magazine"},{"key":"5843_CR69","unstructured":"Silver, D., Hubert, T., Schrittwieser, J., Antonoglou, I., Lai, M., Guez, A., et\u00a0al. (2017). Mastering chess and shogi by self-play with a general reinforcement learning algorithm. arXiv preprint arXiv:1712.01815."},{"key":"5843_CR70","doi-asserted-by":"crossref","unstructured":"Srinivasan, A. (2001). The ALEPH manual. In Machine learning at the computing laboratory. Oxford University.","DOI":"10.1023\/A:1010980106294"},{"key":"5843_CR71","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/3540635149_56","volume":"1297","author":"A Srinivasan","year":"1997","unstructured":"Srinivasan, A., King, R. D., Muggleton, S. H., & Sternberg, M. J. E. (1997). Carcinogenesis predictions using ILP. Inductive Logic Programming, 1297, 273\u2013287.","journal-title":"Inductive Logic Programming"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-019-05843-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-019-05843-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-019-05843-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,6]],"date-time":"2022-10-06T00:40:56Z","timestamp":1665016856000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-019-05843-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,18]]},"references-count":71,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2020,7]]}},"alternative-id":["5843"],"URL":"https:\/\/doi.org\/10.1007\/s10994-019-05843-w","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"type":"print","value":"0885-6125"},{"type":"electronic","value":"1573-0565"}],"subject":[],"published":{"date-parts":[[2019,11,18]]},"assertion":[{"value":"20 February 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 June 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 September 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 November 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}