{"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":1740123128722,"version":"3.37.3"},"reference-count":63,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2019,11,20]],"date-time":"2019-11-20T00:00:00Z","timestamp":1574208000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,11,20]],"date-time":"2019-11-20T00:00:00Z","timestamp":1574208000000},"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>Many forms of inductive logic programming (ILP) use<jats:italic>metarules<\/jats:italic>, second-order Horn clauses, to define the structure of learnable programs and thus the hypothesis space. Deciding which metarules to use for a given learning task is a major open problem and is a trade-off between efficiency and expressivity: the hypothesis space grows given more metarules, so we wish to use fewer metarules, but if we use too few metarules then we lose expressivity. In this paper, we study whether fragments of metarules can be logically reduced to minimal finite subsets. We consider two traditional forms of logical reduction: subsumption and entailment. We also consider a new reduction technique called<jats:italic>derivation reduction<\/jats:italic>, which is based on SLD-resolution. We compute reduced sets of metarules for fragments relevant to ILP and theoretically show whether these reduced sets are reductions for more general infinite fragments. We experimentally compare learning with reduced sets of metarules on three domains: Michalski trains, string transformations, and game rules. In general, derivation reduced sets of metarules outperform subsumption and entailment reduced sets, both in terms of predictive accuracies and learning times.<\/jats:p>","DOI":"10.1007\/s10994-019-05834-x","type":"journal-article","created":{"date-parts":[[2019,11,20]],"date-time":"2019-11-20T22:01:38Z","timestamp":1574287298000},"page":"1323-1369","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Logical reduction of metarules"],"prefix":"10.1007","volume":"109","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4543-7199","authenticated-orcid":false,"given":"Andrew","family":"Cropper","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sophie","family":"Tourret","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,11,20]]},"reference":[{"key":"5834_CR1","doi-asserted-by":"crossref","unstructured":"Albarghouthi, A., Koutris, P., Naik, M., & Smith, C. (2017). Constraint-based synthesis of Datalog programs. In J. C. Beck (Ed.), Principles and practice of constraint programming\u201423rd international conference, CP 2017, Melbourne, VIC, Australia, August 28\u2013September 1, 2017, Proceedings, volume 10416 of Lecture Notes in Computer Science (pp. 689\u2013706). Springer.","DOI":"10.1007\/978-3-319-66158-2_44"},{"key":"5834_CR2","unstructured":"Bienvenu, M. (2007). Prime implicates and prime implicants in modal logic. In Proceedings of the twenty-second AAAI conference on artificial intelligence, July 22\u201326, 2007, Vancouver, BC, Canada (pp. 379\u2013384). AAAI Press."},{"issue":"6","key":"5834_CR3","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/0020-0190(87)90114-1","volume":"24","author":"A Blumer","year":"1987","unstructured":"Blumer, A., Ehrenfeucht, A., Haussler, D., & Warmuth, M. K. (1987). Occam\u2019s razor. Information Processing Letters, 24(6), 377\u2013380.","journal-title":"Information Processing Letters"},{"key":"5834_CR4","volume-title":"The calculus of computation-decision procedures with applications to verification","author":"AR Bradley","year":"2007","unstructured":"Bradley, A. R., & Manna, Z. (2007). The calculus of computation-decision procedures with applications to verification. Berlin: Springer."},{"key":"5834_CR5","unstructured":"Campero, A., Pareja, A., Klinger, T., Tenenbaum, J., & Riedel, S. (2018). Logical rule induction and theory learning using neural theorem proving. ArXiv e-prints, September 2018."},{"issue":"1","key":"5834_CR6","doi-asserted-by":"publisher","first-page":"40","DOI":"10.2307\/2269326","volume":"1","author":"A Church","year":"1936","unstructured":"Church, A. (1936). A note on the Entscheidungsproblem. The Journal of Symbolic Logic, 1(1), 40\u201341.","journal-title":"The Journal of Symbolic Logic"},{"issue":"2","key":"5834_CR7","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0004-3702(94)90070-1","volume":"68","author":"WW Cohen","year":"1994","unstructured":"Cohen, W. W. (1994). Grammatically biased learning: Learning logic programs using an explicit antecedent description language. Artificial Intelligence, 68(2), 303\u2013366.","journal-title":"Artificial Intelligence"},{"key":"5834_CR8","unstructured":"Cropper, A. (2017). Efficiently learning efficient programs. Ph.D. thesis, Imperial College London, UK."},{"key":"5834_CR9","unstructured":"Cropper, A., Evans, R., & Law, M. (2019). Inductive general game playing. ArXiv e-prints, arXiv:1906.09627, Jun 2019."},{"key":"5834_CR10","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":"5834_CR11","unstructured":"Cropper, A., & Muggleton, S. H. (2015). Learning efficient logical robot strategies involving composable objects. In Yang, Q., & Wooldridge, M. (Eds.), Proceedings of the twenty-fourth international joint conference on artificial intelligence, IJCAI 2015, Buenos Aires, Argentina, July 25\u201331, 2015 (pp. 3423\u20133429). AAAI Press."},{"key":"5834_CR12","unstructured":"Cropper, A., & Muggleton, S. H. (2016a). Learning higher-order logic programs through abstraction and invention. In Kambhampati, S. (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":"5834_CR13","unstructured":"Cropper, A., & Muggleton, S. H. (2016b). Metagol system. https:\/\/github.com\/metagol\/metagol. Accessed 1 July 2019."},{"issue":"7","key":"5834_CR14","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":"5834_CR15","unstructured":"Cropper, A., Tamaddoni-Nezhad, A., & Muggleton, S. H. (2015). Meta-interpretive learning of data transformation programs. In Inoue, K., Ohwada, H., & Yamamoto, A. (Eds.), Inductive logic programming\u201425th international conference, ILP 2015, Kyoto, Japan, August 20\u201322, 2015, revised selected papers, volume 9575 of Lecture Notes in Computer Science (pp. 46\u201359). Springer."},{"key":"5834_CR16","doi-asserted-by":"crossref","unstructured":"Cropper, A., & Tourret, S. (2018). Derivation reduction of metarules in meta-interpretive learning. In Riguzzi, F., Bellodi, E., & Zese, R. (Eds.), Inductive logic programming\u201428th international conference, ILP 2018, Ferrara, Italy, September 2\u20134, 2018, proceedings, volume 11105 of Lecture Notes in Computer Science (pp. 1\u201321). Springer.","DOI":"10.1007\/978-3-319-99960-9_1"},{"issue":"3","key":"5834_CR17","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, 33(3), 374\u2013425.","journal-title":"ACM Computing Surveys"},{"key":"5834_CR18","unstructured":"De Raedt, L. (2012). Declarative modeling for machine learning and data mining. In Algorithmic learning theory\u201423rd international conference, ALT 2012, Lyon, France, October 29\u201331, 2012. proceedings (p. 12)."},{"key":"5834_CR19","first-page":"107","volume":"8","author":"L De Raedt","year":"1992","unstructured":"De Raedt, L., & Bruynooghe, M. (1992). Interactive concept-learning and constructive induction by analogy. Machine Learning, 8, 107\u2013150.","journal-title":"Machine Learning"},{"key":"5834_CR20","doi-asserted-by":"crossref","unstructured":"Echenim, M., Peltier, N., & Tourret, S. (2015). Quantifier-free equational logic and prime implicate generation. In A. P. Felty & A. Middeldorp (Eds.), Automated deduction\u2014CADE-25\u201325th international conference on automated deduction, Berlin, Germany, August 1\u20137, 2015, proceedings, volume 9195 of Lecture Notes in Computer Science (pp. 311\u2013325). Springer.","DOI":"10.1007\/978-3-319-21401-6_21"},{"key":"5834_CR21","unstructured":"Emde, W., Habel, C., & Rollinger, C.-R. (1983). The discovery of the equator or concept driven learning. In M. Alanbundy (Ed.), Proceedings of the 8th international joint conference on artificial intelligence. Karlsruhe, FRG, August 1983 (pp. 455\u2013458). William Kaufmann."},{"key":"5834_CR22","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 Research, 61, 1\u201364.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"5834_CR23","unstructured":"Flener, P. (1996). Inductive logic program synthesis with DIALOGS. In Muggleton, S. (Ed.), Inductive logic programming, 6th international workshop, ILP-96, Stockholm, Sweden, August 26\u201328, 1996, selected papers, volume 1314 of Lecture Notes in Computer Science (pp. 175\u2013198). Springer."},{"key":"5834_CR24","doi-asserted-by":"crossref","unstructured":"Fonseca, N. A., Costa, V. S., Silva, F. M. A., & Camacho, R. (2004). On avoiding redundancy in inductive logic programming. In R. Camacho, R. D. King & A. Srinivasan (Eds.), Inductive logic programming, 14th international conference, ILP 2004, Porto, Portugal, September 6\u20138, 2004, proceedings, volume 3194 of Lecture Notes in Computer Science (pp. 132\u2013146). Springer.","DOI":"10.1007\/978-3-540-30109-7_13"},{"key":"5834_CR25","unstructured":"F\u00fcrnkranz, J. (1997). Dimensionality reduction in ILP: A call to arms. In Proceedings of the IJCAI-97 workshop on frontiers of inductive logic programming (pp. 81\u201386)."},{"key":"5834_CR26","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. New York: W. H. Freeman."},{"issue":"2","key":"5834_CR27","first-page":"62","volume":"26","author":"MR Genesereth","year":"2005","unstructured":"Genesereth, M. R., Love, N., & Pell, B. (2005). General game playing: Overview of the AAAI competition. AI Magazine, 26(2), 62\u201372.","journal-title":"AI Magazine"},{"issue":"2","key":"5834_CR28","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0004-3702(93)90069-N","volume":"61","author":"G Gottlob","year":"1993","unstructured":"Gottlob, G., & Ferm\u00fcller, C. G. (1993). Removing redundancy from a clause. Artificial Intelligence, 61(2), 263\u2013289.","journal-title":"Artificial Intelligence"},{"key":"5834_CR29","doi-asserted-by":"crossref","unstructured":"Gottlob, G., Leone, N., & Scarcello, F.(1997). On the complexity of some inductive logic programming problems. In N. Lavrac & S. Dzeroski (Eds.), Inductive logic programming, 7th international workshop, ILP-97, Prague, Czech Republic, September 17\u201320, 1997, proceedings, volume 1297 of Lecture Notes in Computer Science (pp. 17\u201332). Springer.","DOI":"10.1007\/3540635149_31"},{"key":"5834_CR30","unstructured":"Hemaspaandra, E., & Schnoor, H. (2011). Minimization for generalized boolean formulas. In T. Walsh (Ed.), IJCAI 2011, proceedings of the 22nd international joint conference on artificial intelligence, Barcelona, Catalonia, Spain, July 16\u201322, 2011 (pp. 566\u2013571). IJCAI\/AAAI."},{"key":"5834_CR31","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1613\/jair.4694","volume":"53","author":"M Heule","year":"2015","unstructured":"Heule, M., J\u00e4rvisalo, M., Lonsing, F., Seidl, M., & Biere, A. (2015). Clause elimination for SAT and QSAT. Artificial Intelligence Research, 53, 127\u2013168.","journal-title":"Artificial Intelligence Research"},{"key":"5834_CR32","doi-asserted-by":"crossref","unstructured":"Hillenbrand, T., Piskac, R., Waldmann, U., & Weidenbach, C. (2013). From search to computation: Redundancy criteria and simplification at work. In A. Voronkov, & C. Weidenbach (Eds.), Programming logics - essays in memory of Harald Ganzinger, volume 7797 of Lecture Notes in Computer Science (pp. 169\u2013193). Springer.","DOI":"10.1007\/978-3-642-37651-1_7"},{"issue":"3","key":"5834_CR33","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1145\/321958.321960","volume":"23","author":"WH Joyner Jr","year":"1976","unstructured":"Joyner, W. H, Jr. (1976). Resolution strategies as decision procedures. Journal of the ACM, 23(3), 398\u2013417.","journal-title":"Journal of the ACM"},{"issue":"3\u20134","key":"5834_CR34","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":"5834_CR35","unstructured":"Kietz, J.-U., & Wrobel, S. (1992). Controlling the complexity of learning in logic through syntactic and task-oriented models. In Inductive logic programming. Citeseer."},{"key":"5834_CR36","unstructured":"Kowalski, R.\u00a0A. (1974). Predicate logic as programming language. In IFIP congress (pp. 569\u2013574)."},{"key":"5834_CR37","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1145\/1045343.1045369","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"},{"issue":"2","key":"5834_CR38","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.artint.2004.11.002","volume":"163","author":"P Liberatore","year":"2005","unstructured":"Liberatore, P. (2005). Redundancy in logic I: CNF propositional formulae. Artificial Intelligence, 163(2), 203\u2013232.","journal-title":"Artificial Intelligence"},{"issue":"2\u20133","key":"5834_CR39","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.artint.2007.06.003","volume":"172","author":"P Liberatore","year":"2008","unstructured":"Liberatore, P. (2008). Redundancy in logic II: 2CNF and Horn propositional formulae. Artificial Intelligence, 172(2\u20133), 265\u2013299.","journal-title":"Artificial Intelligence"},{"key":"5834_CR40","unstructured":"Lin, D., Dechter, E., Ellis, K., Tenenbaum, J. B., & Muggleton, S. (2014). Bias reformulation for one-shot function induction. In ECAI 2014\u201421st European conference on artificial intelligence, 18\u201322 August 2014, Prague, Czech Republic\u2014including prestigious applications of intelligent systems (PAIS 2014) (pp. 525\u2013530)."},{"key":"5834_CR41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of logic programming","author":"JW Lloyd","year":"1987","unstructured":"Lloyd, J. W. (1987). Foundations of logic programming (2nd ed.). Berlin: Springer.","edition":"2"},{"key":"5834_CR42","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-08406-9","volume-title":"Logic for learning","author":"JW Lloyd","year":"2003","unstructured":"Lloyd, J. W. (2003). Logic for learning. Berlin: Springer."},{"key":"5834_CR43","doi-asserted-by":"crossref","unstructured":"Marcinkowski, J., & Pacholski, L. (1992). Undecidability of the Horn-clause implication problem. In 33rd annual symposium on foundations of computer science, Pittsburgh, Pennsylvania, USA, 24\u201327 October 1992 (pp. 354\u2013362).","DOI":"10.1109\/SFCS.1992.267755"},{"key":"5834_CR44","doi-asserted-by":"crossref","unstructured":"Marquis, P. (2000). Consequence finding algorithms. In Handbook of defeasible reasoning and uncertainty management systems (pp. 41\u2013145). Springer.","DOI":"10.1007\/978-94-017-1737-3_3"},{"key":"5834_CR45","unstructured":"McCarthy, J. (1995). Making robots conscious of their mental states. In Machine intelligence 15, intelligent Agents [St. Catherine\u2019s College, Oxford, July 1995] (pp. 3\u201317)."},{"key":"5834_CR46","doi-asserted-by":"crossref","unstructured":"Morel, R., Cropper, A., & Ong, C.-H. Luke (2019). Typed meta-interpretive learning of logic programs. In Calimeri, F., Leone, N., & Manna, M. (Eds.), Logics in artificial intelligence\u201416th European conference, JELIA 2019, Rende, Italy, May 7\u201311, 2019, proceedings, volume 11468 of Lecture Notes in Computer Science (pp. 198\u2013213). Springer.","DOI":"10.1007\/978-3-030-19570-0_13"},{"issue":"3&4","key":"5834_CR47","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"},{"issue":"1","key":"5834_CR48","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"},{"key":"5834_CR49","unstructured":"Muggleton, S., & Feng, C. (1990). Efficient induction of logic programs. In Algorithmic learning theory, first international workshop, ALT \u201990, Tokyo, Japan, October 8\u201310, 1990, proceedings (pp. 368\u2013381)."},{"issue":"1","key":"5834_CR50","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":"5834_CR51","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":"5834_CR52","first-page":"82","volume":"32","author":"C N\u00e9dellec","year":"1996","unstructured":"N\u00e9dellec, C., Rouveirol, C., Ad\u00e9, H., Bergadano, F., & Tausend, B. (1996). Declarative bias in ILP. Advances in inductive logic programming, 32, 82\u2013103.","journal-title":"Advances in inductive logic programming"},{"key":"5834_CR53","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, Secaucus, NJ: Springer."},{"key":"5834_CR54","unstructured":"Plotkin, G.D. (1971). Automatic methods of inductive inference. Ph.D. thesis, Edinburgh University, August 1971."},{"issue":"1","key":"5834_CR55","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/321250.321253","volume":"12","author":"JA Robinson","year":"1965","unstructured":"Robinson, J. A. (1965). A machine-oriented logic based on the resolution principle. Journal of the ACM, 12(1), 23\u201341.","journal-title":"Journal of the ACM"},{"key":"5834_CR56","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/0304-3975(88)90146-6","volume":"59","author":"M Schmidt-Schau\u00df","year":"1988","unstructured":"Schmidt-Schau\u00df, M. (1988). Implication of clauses is undecidable. Theoretical Computer Science, 59, 287\u2013296.","journal-title":"Theoretical Computer Science"},{"key":"5834_CR57","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. London: MIT Press."},{"key":"5834_CR58","doi-asserted-by":"crossref","unstructured":"Si, X., Lee, W., Zhang, R., Albarghouthi, A., Koutris, P., & Naik, M. (2018). Syntax-guided synthesis of Datalog programs. In G. T. Leavens, A. Garcia, & C. S. Pasareanu (Eds.), Proceedings of the 2018 ACM joint meeting on european software engineering conference and symposium on the foundations of software engineering, ESEC\/SIGSOFT FSE 2018, Lake Buena Vista, FL, USA, November 04\u201309, 2018 (pp. 515\u2013527). ACM.","DOI":"10.1145\/3236024.3236034"},{"key":"5834_CR59","doi-asserted-by":"publisher","DOI":"10.1201\/9781584888338","volume-title":"Understanding complex datasets: Data mining with matrix decompositions","author":"D Skillicorn","year":"2007","unstructured":"Skillicorn, D. (2007). Understanding complex datasets: Data mining with matrix decompositions. New York: Chapman and Hall\/CRC."},{"issue":"2","key":"5834_CR60","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF01932293","volume":"17","author":"S\u00c5 T\u00e4rnlund","year":"1977","unstructured":"T\u00e4rnlund, S. \u00c5. (1977). Horn clause computability. BIT, 17(2), 215\u2013226.","journal-title":"BIT"},{"key":"5834_CR61","doi-asserted-by":"crossref","unstructured":"Tourret, S., & Cropper, A. (2019). SLD-resolution reduction of second-order Horn fragments. In F. Calimeri, N. Leone & M. Manna (Eds.), Logics in artificial intelligence\u201416th European conference, JELIA 2019, Rende, Italy, May 7\u201311, 2019, proceedings, volume 11468 of Lecture Notes in Computer Science (pp. 259\u2013276). Springer.","DOI":"10.1007\/978-3-030-19570-0_17"},{"key":"5834_CR62","doi-asserted-by":"crossref","unstructured":"Wang, W.\u00a0Y., Mazaitis, K., & Cohen, W. W. (2014). Structure learning via parameter learning. In Li, J., Wang, X.\u00a0S., Garofalakis, M.\u00a0N., Soboroff, I., Suel, T., & Wang, M. (Eds.), Proceedings of the 23rd ACM international conference on conference on information and knowledge management, CIKM 2014, Shanghai, China, November 3\u20137, 2014 (pp. 1199\u20131208). ACM.","DOI":"10.1145\/2661829.2662022"},{"issue":"2\u20133","key":"5834_CR63","doi-asserted-by":"publisher","first-page":"97","DOI":"10.3233\/AIC-2010-0459","volume":"23","author":"C Weidenbach","year":"2010","unstructured":"Weidenbach, C., & Wischnewski, P. (2010). Subterm contextual rewriting. AI Communications, 23(2\u20133), 97\u2013109.","journal-title":"AI Communications"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-019-05834-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-019-05834-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-019-05834-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,27]],"date-time":"2024-07-27T12:20:48Z","timestamp":1722082848000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-019-05834-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,20]]},"references-count":63,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2020,7]]}},"alternative-id":["5834"],"URL":"https:\/\/doi.org\/10.1007\/s10994-019-05834-x","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"type":"print","value":"0885-6125"},{"type":"electronic","value":"1573-0565"}],"subject":[],"published":{"date-parts":[[2019,11,20]]},"assertion":[{"value":"15 February 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 July 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":"20 November 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}