{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T12:41:25Z","timestamp":1771504885447,"version":"3.50.1"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2018,4,23]],"date-time":"2018-04-23T00:00:00Z","timestamp":1524441600000},"content-version":"tdm","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":[[2019,7]]},"DOI":"10.1007\/s10994-018-5712-6","type":"journal-article","created":{"date-parts":[[2018,4,23]],"date-time":"2018-04-23T19:07:23Z","timestamp":1524510443000},"page":"1063-1083","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Learning efficient logic programs"],"prefix":"10.1007","volume":"108","author":[{"given":"Andrew","family":"Cropper","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen H.","family":"Muggleton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,4,23]]},"reference":[{"issue":"2","key":"5712_CR1","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0019-9958(75)90261-2","volume":"28","author":"L Blum","year":"1975","unstructured":"Blum, L., & Blum, M. (1975). Toward a mathematical theory of inductive inference. Information and Control, 28(2), 125\u2013155.","journal-title":"Information and Control"},{"key":"5712_CR2","unstructured":"Cropper, A., & Muggleton, Stephen\u00a0H. (2015). Learning efficient logical robot strategies involving composable objects. In IJCAI (pp. 3423\u20133429). AAAI Press."},{"key":"5712_CR3","unstructured":"Cropper, A., & Muggleton, S. H. (2016a). Learning higher-order logic programs through abstraction and invention. In IJCAI (pp. 1418\u20131424). IJCAI\/AAAI Press."},{"key":"5712_CR4","unstructured":"Cropper, A., & Muggleton, S. H. (2016b). Metagol system. https:\/\/github.com\/metagol\/metagol ."},{"key":"5712_CR5","unstructured":"Debray, S.\u00a0K., L\u00f3pez-Garc\u00eda, P., Hermenegildo, M.V., & Lin, N.-W. (1997). Lower bound cost estimation for logic programs. In Logic programming. Proceedings of the 1997 international symposium (pp. 291\u2013305), Port Jefferson, Long Island, NY, USA, October 13\u201316, 1997"},{"key":"5712_CR6","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1613\/jair.1148","volume":"19","author":"T Eiter","year":"2003","unstructured":"Eiter, T., Faber, W., Leone, N., Pfeifer, G., & Polleres, A. (2003). Answer set planning under action costs. Journal of Artificial Intelligence Research, 19, 25\u201371.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"5712_CR7","doi-asserted-by":"crossref","unstructured":"Gulwani, S. (2011). Automating string processing in spreadsheets using input\u2013output examples. In Proceedings of the 38th ACM SIGPLAN-SIGACT symposium on principles of programming languages, POPL 2011 (pp. 317\u2013330), Austin, TX, USA, January 26\u201328, 2011","DOI":"10.1145\/1926385.1926423"},{"issue":"11","key":"5712_CR8","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1145\/2736282","volume":"58","author":"S Gulwani","year":"2015","unstructured":"Gulwani, S., Hern\u00e1ndez-Orallo, J., Kitzelmann, E., Muggleton, S. H., Schmid, U., & Zorn, B. G. (2015). Inductive programming meets the real world. Communications of the ACM, 58(11), 90\u201399.","journal-title":"Communications of the ACM"},{"key":"5712_CR9","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1613\/jair.855","volume":"14","author":"J Hoffmann","year":"2001","unstructured":"Hoffmann, J., & Nebel, B. (2001). The ff planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research, 14, 253\u2013302.","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"3","key":"5712_CR10","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/0004-3702(83)90009-7","volume":"20","author":"E Kant","year":"1983","unstructured":"Kant, E. (1983). On the efficient synthesis of efficient programs. Artificial Intelligence, 20(3), 253\u2013305.","journal-title":"Artificial Intelligence"},{"key":"5712_CR11","unstructured":"Kaplan, S. (1988). Algorithmic complexity of logic programs. In Logic Programming, Proceedings of the fifth international conference and symposium (pp. 780\u2013793), Seattle, Washington, August 15\u201319, 1988 (2 Volumes)."},{"key":"5712_CR12","unstructured":"Kilby, P., & Slaney, J. K. (2006). Sylvie Thi\u00e9baux, and Toby Walsh. Estimating search tree size. In AAAI (pp. 1014\u20131019). AAAI Press."},{"key":"5712_CR13","first-page":"224","volume":"171","author":"JE Laird","year":"2008","unstructured":"Laird, J. E. (2008). Extending the soar cognitive architecture. Frontiers in Artificial Intelligence and Applications, 171, 224\u2013235.","journal-title":"Frontiers in Artificial Intelligence and Applications"},{"key":"5712_CR14","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-319-11558-0_22","volume-title":"Logics in artificial intelligence","author":"M Law","year":"2014","unstructured":"Law, M., Russo, A., & Broda, K. (2014). Inductive learning of answer set programs. In E. Ferm\u00e9 & J. Leite (Eds.), Logics in artificial intelligence (pp. 311\u2013325). Berlin: Springer."},{"issue":"1","key":"5712_CR15","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/S0019-9958(84)80060-1","volume":"61","author":"LA Levin","year":"1984","unstructured":"Levin, L. A. (1984). Randomness conservation inequalities; information and independence in mathematical theories. Information and Control, 61(1), 15\u201337.","journal-title":"Information and Control"},{"key":"5712_CR16","unstructured":"Lin, D., Dechter, E., Ellis, K., Tenenbaum, J.\u00a0B., & Muggleton, S. (2014). Bias reformulation for one-shot function induction. In ECAI, volume 263 of Frontiers in artificial intelligence and applications (pp. 525\u2013530). IOS Press."},{"key":"5712_CR17","unstructured":"Manna, Z., & Waldinger, R. (1979). A deductive approach to program synthesis. In IJCAI (pp. 542\u2013551). William Kaufmann ."},{"key":"5712_CR18","series-title":"McGraw Hill series in computer science","volume-title":"Machine learning","author":"TM Mitchell","year":"1997","unstructured":"Mitchell, T. M. (1997). Machine learning., McGraw Hill series in computer science New York: McGraw-Hill."},{"key":"5712_CR19","unstructured":"Moyle, S., & Muggleton, S. H. (1997). Learning programs in the event calculus. In N. Lavra\u010d, & S. D\u017eeroski, S. (Eds.), Proceedings of the seventh inductive logic programming workshop (ILP97), LNAI 1297 (pp. 205\u2013212). Berlin: Springer-Verlag."},{"key":"5712_CR20","doi-asserted-by":"publisher","unstructured":"Muggleton, S. H., Dai, W-Z., Sammut, C., Tamaddoni-Nezhad, A., Wen, J., & Zhou, Z-H. (2018). Meta-interpretive learning from noisy images. Machine Learning. https:\/\/doi.org\/10.1007\/s10994-018-5710-8 .","DOI":"10.1007\/s10994-018-5710-8"},{"issue":"3&4","key":"5712_CR21","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":"5712_CR22","unstructured":"Muggleton, S., & Feng, C. (1990). Efficient induction of logic programs. In ALT (pp. 368\u2013381)."},{"key":"5712_CR23","doi-asserted-by":"crossref","unstructured":"Muggleton, S., Srinivasan, A., & Bain, M. (1992). Compression, significance, and accuracy. In D. H. Sleeman & P. Edwards (Eds.), Proceedings of the ninth international workshop on machine learning (ML 1992) (pp. 338\u2013347), Aberdeen, Scotland, UK, July 1\u20133, 1992. Morgan Kaufmann.","DOI":"10.1016\/B978-1-55860-247-2.50048-6"},{"issue":"1","key":"5712_CR24","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":"5712_CR25","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":"5712_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-62927-0","volume-title":"Foundations of inductive logic programming","author":"S-H Nienhuys-Cheng","year":"1997","unstructured":"Nienhuys-Cheng, S.-H., & de Wolf, R. (1997). Foundations of inductive logic programming. New York: Springer."},{"key":"5712_CR27","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1613\/jair.30","volume":"1","author":"NJ Nilsson","year":"1994","unstructured":"Nilsson, N. J. (1994). Teleo-reactive programs for agent control. Journal of Artificial Intelligence Research (JAIR), 1, 139\u2013158.","journal-title":"Journal of Artificial Intelligence Research (JAIR)"},{"key":"5712_CR28","unstructured":"Otero, R.\u00a0P. (2005). Induction of the indirect effects of actions by monotonic methods. In: S. Kramer & B. Pfahringer (Eds.), Inductive logic programming. 15th international conference, ILP 2005. Proceedings, volume 3625 of Lecture notes in computer science (pp. 279\u2013294), Bonn, Germany, August 10\u201313, 2005. Springer."},{"issue":"20","key":"5712_CR29","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0743-1066(94)90028-0","volume":"19","author":"A Pettorossi","year":"1994","unstructured":"Pettorossi, A., & Proietti, M. (1994). Transformation of logic programs: Foundations and techniques. The Journal of Logic Programming, 19(20), 261\u2013320.","journal-title":"The Journal of Logic Programming"},{"key":"5712_CR30","first-page":"153","volume-title":"Machine Intelligence","author":"GD Plotkin","year":"1969","unstructured":"Plotkin, G. D. (1969). A note on inductive generalisation. In B. Meltzer & D. Michie (Eds.), Machine Intelligence (Vol. 5, pp. 153\u2013163). Edinburgh: Edinburgh University Press."},{"key":"5712_CR31","unstructured":"Plotkin, G.D. (1971). A further note on inductive generalization. In Machine intelligence (Vol. 6). Edinburgh: University Press."},{"key":"5712_CR32","volume-title":"Markov decision processes: Discrete stochastic dynamic programming","author":"ML Puterman","year":"2014","unstructured":"Puterman, M. L. (2014). Markov decision processes: Discrete stochastic dynamic programming. Hoboken: Wiley."},{"key":"5712_CR33","volume-title":"Artificial intelligence: A modern approach","author":"SJ Russell","year":"2010","unstructured":"Russell, S. J., & Norvig, P. (2010). Artificial intelligence: A modern approach (3rd ed.). New Jersey: Pearson.","edition":"3"},{"key":"5712_CR34","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1192.001.0001","volume-title":"Algorithmic program debugging","author":"EY Shapiro","year":"1983","unstructured":"Shapiro, E. Y. (1983). Algorithmic program debugging. Cambridge: MIT Press."},{"key":"5712_CR35","volume-title":"The art of Prolog\u2013advanced programming techniques","author":"L Sterling","year":"1994","unstructured":"Sterling, L., & Shapiro, E. Y. (1994). The art of Prolog\u2013advanced programming techniques (2nd ed.). Cambridge: MIT Press.","edition":"2"},{"issue":"1","key":"5712_CR36","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1145\/321992.322002","volume":"24","author":"PD Summers","year":"1977","unstructured":"Summers, P. D. (1977). A methodology for LISP program construction from examples. Journal of ACM, 24(1), 161\u2013175.","journal-title":"Journal of ACM"},{"key":"5712_CR37","volume-title":"Reinforcement learning\u2014An introduction. Adaptive computation and machine learning","author":"RS Sutton","year":"1998","unstructured":"Sutton, R. S., & Barto, A. G. (1998). Reinforcement learning\u2014An introduction. Adaptive computation and machine learning. Cambridge: MIT Press."},{"key":"5712_CR38","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-642-27645-3_1","volume-title":"Reinforcement Learning","author":"M Otterlo van","year":"2012","unstructured":"van Otterlo, M., & Wiering, M. (2012). Reinforcement learning and Markov decision processes. In M. Wiering & M. van Otterlo (Eds.), Reinforcement Learning (pp. 3\u201342). Berlin: Springer."},{"key":"5712_CR39","unstructured":"Vera, S. (1975). Induction of concepts in the predicate calculus. In Advance papers of the fourth international joint conference on artificial intelligence (pp. 281\u2013287), Tbilisi, Georgia, USSR, September 3-8, 1975."},{"issue":"1\u20132","key":"5712_CR40","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"},{"key":"5712_CR41","unstructured":"Xing, Z., Chen, Y., & Zhang, W. (2006). Optimal strips planning by maximum satisfiability and accumulative learning. In Proceedings of the international conference on autonomous planning and scheduling (ICAPS) (pp. 442\u2013446)."},{"key":"5712_CR42","unstructured":"Yang, F., Khandelwal, P., Leonetti, M., & Stone, P. (2014). Planning in answer set programming while learning action costs for mobile robots. AAAI spring 2014 symposium on knowledge representation and reasoning in robotics (AAAI-SSS)."},{"key":"5712_CR43","unstructured":"Zelle, J.\u00a0M., & Mooney, R.\u00a0J. (1993). Combining FOIL and EBG to speed-up logic programs. In IJCAI (pp. 1106\u20131113). Morgan Kaufmann."}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-018-5712-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-018-5712-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-018-5712-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,6]],"date-time":"2024-07-06T07:20:45Z","timestamp":1720250445000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-018-5712-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,23]]},"references-count":43,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["5712"],"URL":"https:\/\/doi.org\/10.1007\/s10994-018-5712-6","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,4,23]]},"assertion":[{"value":"17 November 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 April 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 April 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}