{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T01:01:28Z","timestamp":1769043688604,"version":"3.49.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,5,1]],"date-time":"2013-05-01T00:00:00Z","timestamp":1367366400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2014,1]]},"DOI":"10.1007\/s10994-013-5358-3","type":"journal-article","created":{"date-parts":[[2013,5,2]],"date-time":"2013-05-02T02:22:09Z","timestamp":1367461329000},"page":"25-49","source":"Crossref","is-referenced-by-count":76,"title":["Meta-interpretive learning: application to grammatical inference"],"prefix":"10.1007","volume":"94","author":[{"given":"Stephen H.","family":"Muggleton","sequence":"first","affiliation":[]},{"given":"Dianhuan","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Niels","family":"Pahlavi","sequence":"additional","affiliation":[]},{"given":"Alireza","family":"Tamaddoni-Nezhad","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,5,1]]},"reference":[{"key":"5358_CR1","volume-title":"Proceedings of the 28th International Conference on Logic Programming","author":"B. Andres","year":"2012","unstructured":"Andres, B., Kaufmann, B., Matheis, O., & Schaub, T. (2012). Unsatisfiability-based optimization in clasp. In Proceedings of the 28th International Conference on Logic Programming."},{"issue":"4","key":"5358_CR2","doi-asserted-by":"crossref","first-page":"929","DOI":"10.1145\/76359.76371","volume":"36","author":"A. Blumer","year":"1989","unstructured":"Blumer, A., Ehrenfeucht, A., Haussler, D., & Warmuth, M. K. (1989). Learnability and the Vapnik-Chervonenkis dimension. Journal of the ACM, 36(4), 929\u2013965.","journal-title":"Journal of the ACM"},{"key":"5358_CR3","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1007\/BFb0026693","volume-title":"10th European Conference on Machine Learning (ECML-98)","author":"H. Bostr\u00f6m","year":"1998","unstructured":"Bostr\u00f6m, H. (1998). Predicate invention and learning from positive examples only. In 10th European Conference on Machine Learning (ECML-98) (pp.\u00a0226\u2013237). Berlin: Springer."},{"key":"5358_CR4","series-title":"LNAI","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/3-540-40030-3_9","volume-title":"Proceedings of Learning Language in Logic (LLL2000)","author":"J. Cussens","year":"2000","unstructured":"Cussens, J., & Pulman, S. (2000). Experiments in inductive chart parsing. In J. Cussens & S. Dzeroski (Eds.), LNAI: Vol.\u00a01925. Proceedings of Learning Language in Logic (LLL2000) (pp.\u00a0143\u2013156). Berlin: Springer."},{"key":"5358_CR5","doi-asserted-by":"crossref","first-page":"1332","DOI":"10.1016\/j.patcog.2005.01.003","volume":"38","author":"C. Higuera de la","year":"2005","unstructured":"de la Higuera, C. (2005). A\u00a0bibliographical study of grammatical inference. Pattern Recognition, 38, 1332\u20131348.","journal-title":"Pattern Recognition"},{"issue":"1","key":"5358_CR6","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1023\/A:1010826628977","volume":"44","author":"F. Denis","year":"2001","unstructured":"Denis, F. (2001). Learning regular languages from simple positive examples. Machine Learning, 44(1), 37\u201366.","journal-title":"Machine Learning"},{"key":"5358_CR7","unstructured":"Farid, R., & Sammut, C. (2012, to appear). Plane-based object categorization using relational learning. ILP2012 MLJ special issue."},{"key":"5358_CR8","series-title":"Pure and Applied Logic.","volume-title":"Abductive and Inductive Reasoning","year":"2000","unstructured":"Flach, P. A. & Kakas, A. C. (Eds.) (2000). Abductive and Inductive Reasoning. Pure and Applied Logic. Amsterdam: Kluwer."},{"key":"5358_CR9","first-page":"729","volume-title":"Grammatical Inference: Algorithms and Applications","author":"C. Flor\u00eancio","year":"2002","unstructured":"Flor\u00eancio, C. (2002). Consistent identification in the limit of rigid grammars from strings is np-hard. In Grammatical Inference: Algorithms and Applications (pp.\u00a0729\u2013733)."},{"key":"5358_CR10","series-title":"Synthesis Lectures on Artificial Intelligence and Machine Learning","volume-title":"Answer Set Solving in Practice","author":"M. Gebser","year":"2012","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., & Schaub, T. (2012). Answer Set Solving in Practice. Synthesis Lectures on Artificial Intelligence and Machine Learning. San Mateo: Morgan and Claypool."},{"key":"5358_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1007\/978-3-540-72200-7_23","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M. Gebser","year":"2007","unstructured":"Gebser, M., Kaufmann, B., Neumann, A., & Schaub, T. (2007). clasp: A conflict-driven answer set solver. In C. Baral, G. Brewka, & J. Schlipf (Eds.), Lecture Notes in Computer Science: Vol.\u00a04483. Logic Programming and Nonmonotonic Reasoning (pp.\u00a0260\u2013265). Berlin: Springer."},{"key":"5358_CR12","volume-title":"Introduction to Automata and Formal Languages","author":"J. E. Hopcroft","year":"1979","unstructured":"Hopcroft, J. E., & Ullman, J. D. (1979). Introduction to Automata and Formal Languages. Reading: Addison-Wesley."},{"key":"5358_CR13","series-title":"LNAI","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/978-3-642-13840-9_6","volume-title":"Proceedings of the Nineteenth International Conference on Inductive Logic Programming (ILP09)","author":"K. Inoue","year":"2010","unstructured":"Inoue, K., Furukawa, K., Kobayashiand, I., & Nabeshima, H. (2010). Discovering rules by meta-level abduction. In L. De Raedt (Ed.), LNAI: Vol.\u00a05989. Proceedings of the Nineteenth International Conference on Inductive Logic Programming (ILP09) (pp.\u00a049\u201364). Berlin: Springer."},{"key":"5358_CR14","first-page":"591","volume-title":"IJCAI","author":"A. C. Kakas","year":"2001","unstructured":"Kakas, A. C., Van Nuffelen, B., & Denecker, M. (2001). A-system: Problem solving through abduction. In IJCAI (pp.\u00a0591\u2013596)."},{"key":"5358_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1007\/3-540-45164-1_23","volume-title":"Machine Learning: ECML 2000","author":"P. Langley","year":"2000","unstructured":"Langley, P., & Stromsten, S. (2000). Learning context-free grammars with a simplicity bias. In R. L\u00f3pez de M\u00e1ntaras & E. Plaza (Eds.), Lecture Notes in Computer Science: Vol.\u00a01810. Machine Learning: ECML 2000 (pp.\u00a0220\u2013228). Berlin: Springer."},{"key":"5358_CR16","first-page":"129","volume-title":"Automata Studies","author":"E. F. Moore","year":"1956","unstructured":"Moore, E. F. (1956). Gedanken-experiments on sequential machines. In C. E. Shannon & J. McCarthy (Eds.), Automata Studies (pp.\u00a0129\u2013153). Princeton: Princeton University Press."},{"key":"5358_CR17","volume-title":"Inductive Acquisition of Expert Knowledge","author":"S. H. Muggleton","year":"1990","unstructured":"Muggleton, S. H. (1990). Inductive Acquisition of Expert Knowledge. Wokingham: Addison-Wesley."},{"key":"5358_CR18","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/BF03037227","volume":"13","author":"S. H. Muggleton","year":"1995","unstructured":"Muggleton, S. H. (1995). Inverse entailment and Progol. New Generation Computing, 13, 245\u2013286.","journal-title":"New Generation Computing"},{"key":"5358_CR19","first-page":"254","volume-title":"Advances in Inductive Logic Programming","author":"S. H. Muggleton","year":"1996","unstructured":"Muggleton, S. H. (1996). Stochastic logic programs. In L. de Raedt (Ed.), Advances in Inductive Logic Programming (pp.\u00a0254\u2013264). Amsterdam: IOS Press."},{"key":"5358_CR20","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1007\/3-540-44960-4_8","volume-title":"Proc. of the 10th International Workshop on Inductive Logic Programming (ILP-00)","author":"S. H. Muggleton","year":"2000","unstructured":"Muggleton, S. H., & Bryant, C. H. (2000). Theory completion using inverse entailment. In Proc. of the 10th International Workshop on Inductive Logic Programming (ILP-00) (pp.\u00a0130\u2013146). Berlin: Springer."},{"key":"5358_CR21","first-page":"339","volume-title":"Proceedings of the 5th International Conference on Machine Learning","author":"S. H. Muggleton","year":"1988","unstructured":"Muggleton, S. H., & Buntine, W. (1988). Machine invention of first-order predicates by inverting resolution. In Proceedings of the 5th International Conference on Machine Learning (pp.\u00a0339\u2013352). Los Altos: Kaufmann."},{"key":"5358_CR22","series-title":"LNAI","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/978-3-642-31951-8_22","volume-title":"Proceedings of the 21st International Conference on Inductive Logic Programming","author":"S. H. Muggleton","year":"2012","unstructured":"Muggleton, S. H., Lin, D., & Tamaddoni-Nezhad, A. (2012). MC-Toplog: Complete multi-clause learning guided by a top theory. In LNAI: Vol.\u00a07207. Proceedings of the 21st International Conference on Inductive Logic Programming (pp.\u00a0238\u2013254)."},{"issue":"1","key":"5358_CR23","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10994-011-5259-2","volume":"86","author":"S. H. Muggleton","year":"2011","unstructured":"Muggleton, S. H., De Raedt, L., Poole, D., Bratko, I., Flach, P., & Inoue, K. (2011). ILP turns 20: biography and future challenges. Machine Learning, 86(1), 3\u201323.","journal-title":"Machine Learning"},{"key":"5358_CR24","series-title":"LNCS","first-page":"687","volume-title":"Proceedings of the International Conference on Logic Programming 2008","author":"S. H. Muggleton","year":"2010","unstructured":"Muggleton, S. H., Santos, J., & Tamaddoni-Nezhad, A. (2010). TopLog: ILP using a logic program declarative bias. In LNCS: Vol.\u00a05366. Proceedings of the International Conference on Logic Programming 2008 (pp.\u00a0687\u2013692). Berlin: Springer."},{"key":"5358_CR25","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-31951-8","volume-title":"Latest Advances in Inductive Logic Programming","author":"S. H. Muggleton","year":"2012","unstructured":"Muggleton, S. H., & Pahlavi, N. (2012, in press). Towards efficient higher-order logic learning in a first-order datalog framework. In Latest Advances in Inductive Logic Programming. London: Imperial College Press."},{"issue":"2\u20133","key":"5358_CR26","doi-asserted-by":"crossref","first-page":"183","DOI":"10.3233\/AIC-2010-0465","volume":"23","author":"H. Nabeshima","year":"2010","unstructured":"Nabeshima, H., Iwanuma, K., Inoue, K., & Ray, O. (2010). Solar: An automated deduction system for consequence finding. AI Commun., 23(2\u20133), 183\u2013203.","journal-title":"AI Commun."},{"key":"5358_CR27","series-title":"LNAI","doi-asserted-by":"crossref","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). LNAI: Vol.\u00a01228. Foundations of Inductive Logic Programming. Berlin: Springer."},{"key":"5358_CR28","first-page":"153","volume-title":"Machine Intelligence","author":"G. D. Plotkin","year":"1969","unstructured":"Plotkin, G. D. (1969). A\u00a0note on inductive generalisation. In B. Meltzer & D. Michie (Eds.), Machine Intelligence (Vol.\u00a05, pp.\u00a0153\u2013163). Edinburgh: Edinburgh University Press."},{"key":"5358_CR29","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1007\/978-3-642-34106-9_2","volume-title":"Proceedings of the International Conference on Algorithmic Learning Theory","author":"L. Raedt De","year":"2012","unstructured":"De Raedt, L. (2012). Declarative modeling for machine learning and data mining. In Proceedings of the International Conference on Algorithmic Learning Theory (p.\u00a012)."},{"issue":"1","key":"5358_CR30","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0890-5401(92)90003-X","volume":"97","author":"Y. Sakakibara","year":"1992","unstructured":"Sakakibara, Y. (1992). Efficient learning of context-freegrammars from positive structural examples. Information and Computation, 97(1), 23\u201360.","journal-title":"Information and Computation"},{"issue":"3","key":"5358_CR31","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1142\/S0218001402001691","volume":"16","author":"I. Salvador","year":"2002","unstructured":"Salvador, I., & Benedi, J. M. (2002). Rna modeling by combining stochastic context-free grammars and n-gram models. International Journal of Pattern Recognition and Artificial Intelligence, 16(3), 309\u2013316.","journal-title":"International Journal of Pattern Recognition and Artificial Intelligence"},{"issue":"2","key":"5358_CR32","first-page":"165","volume":"21","author":"A. Stolcke","year":"1995","unstructured":"Stolcke, A. (1995). An efficient probabilistic context-free parsing algorithm that computes prefix probabilities. Computational Linguistics, 21(2), 165\u2013201.","journal-title":"Computational Linguistics"},{"key":"5358_CR33","first-page":"39","volume":"2","author":"K. Vanlehn","year":"1987","unstructured":"Vanlehn, K., & Ball, W. (1987). A\u00a0version space approach to learning context-free grammars. Machine Learning, 2, 39\u201374.","journal-title":"Machine Learning"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-013-5358-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-013-5358-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-013-5358-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,26]],"date-time":"2020-07-26T04:51:55Z","timestamp":1595739115000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-013-5358-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5,1]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,1]]}},"alternative-id":["5358"],"URL":"https:\/\/doi.org\/10.1007\/s10994-013-5358-3","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,5,1]]}}}