{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T19:42:50Z","timestamp":1743018170910,"version":"3.40.3"},"publisher-location":"Cham","reference-count":48,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030195694"},{"type":"electronic","value":"9783030195700"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-19570-0_17","type":"book-chapter","created":{"date-parts":[[2019,5,6]],"date-time":"2019-05-06T12:27:54Z","timestamp":1557145674000},"page":"259-276","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["SLD-Resolution Reduction of Second-Order Horn Fragments"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6070-796X","authenticated-orcid":false,"given":"Sophie","family":"Tourret","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4543-7199","authenticated-orcid":false,"given":"Andrew","family":"Cropper","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,5,6]]},"reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1007\/978-3-319-66158-2_44","volume-title":"Principles and Practice of Constraint Programming","author":"A Albarghouthi","year":"2017","unstructured":"Albarghouthi, A., Koutris, P., Naik, M., Smith, C.: Constraint-based synthesis of datalog programs. In: Beck, J.C. (ed.) CP 2017. LNCS, vol. 10416, pp. 689\u2013706. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66158-2_44"},{"key":"17_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/9781139025355","volume-title":"An Introduction to Description Logic","author":"F Baader","year":"2017","unstructured":"Baader, F., Horrocks, I., Lutz, C., Sattler, U.: An Introduction to Description Logic. Cambridge University Press, Cambridge (2017)"},{"issue":"2","key":"17_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-6(2:4)2010","volume":"6","author":"JL Balc\u00e1zar","year":"2010","unstructured":"Balc\u00e1zar, J.L.: Redundancy, deduction schemes, and minimum-size bases for association rules. Log. Methods Comput. Sci. 6(2), 1\u201333 (2010)","journal-title":"Log. Methods Comput. Sci."},{"key":"17_CR4","unstructured":"Bienvenu, M.: Prime implicates and prime implicants in modal logic. In: Proceedings of the National Conference on Artificial Intelligence, vol. 22, p. 379. AAAI Press\/MIT Press, Menlo Park\/Cambridge (2007)"},{"issue":"2","key":"17_CR5","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0004-3702(88)90001-X","volume":"36","author":"W Buntine","year":"1988","unstructured":"Buntine, W.: Generalized subsumption and its applications to induction and redundancy. Artif. Intell. 36(2), 149\u2013176 (1988). https:\/\/doi.org\/10.1016\/0004-3702(88)90001-X","journal-title":"Artif. Intell."},{"key":"17_CR6","unstructured":"Campero, A., Pareja, A., Klinger, T., Tenenbaum, J., Riedel, S.: Logical rule induction and theory learning using neural theorem proving. ArXiv e-prints, September 2018"},{"issue":"3","key":"17_CR7","doi-asserted-by":"publisher","first-page":"21:1","DOI":"10.1145\/2499937.2499942","volume":"14","author":"A Charalambidis","year":"2013","unstructured":"Charalambidis, A., Handjopoulos, K., Rondogiannis, P., Wadge, W.W.: Extensional higher-order logic programming. ACM Trans. Comput. Log. 14(3), 21:1\u201321:40 (2013). https:\/\/doi.org\/10.1145\/2499937.2499942","journal-title":"ACM Trans. Comput. Log."},{"key":"17_CR8","unstructured":"Cropper, A.: Efficiently learning efficient programs. Ph.D. thesis, Imperial College London, UK (2017)"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-319-23708-4_5","volume-title":"Inductive Logic Programming","author":"A Cropper","year":"2015","unstructured":"Cropper, A., Muggleton, S.H.: Logical minimisation of meta-rules within meta-interpretive learning. In: Davis, J., Ramon, J. (eds.) ILP 2014. LNCS (LNAI), vol. 9046, pp. 62\u201375. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23708-4_5"},{"key":"17_CR10","unstructured":"Cropper, A., Muggleton, S.H.: 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, 9\u201315 July 2016, New York, pp. 1418\u20131424. IJCAI\/AAAI Press (2016)"},{"key":"17_CR11","unstructured":"Cropper, A., Muggleton, S.H.: Metagol system (2016). https:\/\/github.com\/metagol\/metagol"},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-99960-9_1","volume-title":"Inductive Logic Programming","author":"Andrew Cropper","year":"2018","unstructured":"Cropper, A., Tourret, S.: Derivation reduction of metarules in meta-interpretive learning. In: Proceedings of Inductive Logic Programming - 28th International Conference, ILP 2018, 2\u20134 September 2018, Ferrara, Italy, pp. 1\u201321 (2018). https:\/\/doi.org\/10.1007\/978-3-319-99960-9_1"},{"issue":"3","key":"17_CR13","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.: Complexity and expressive power of logic programming. ACM Comput. Surv. 33(3), 374\u2013425 (2001). https:\/\/doi.org\/10.1145\/502807.502810","journal-title":"ACM Comput. Surv."},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-319-21401-6_21","volume-title":"Automated Deduction - CADE-25","author":"M Echenim","year":"2015","unstructured":"Echenim, M., Peltier, N., Tourret, S.: Quantifier-free equational logic and prime implicate generation. In: Felty, A.P., Middeldorp, A. (eds.) CADE 2015. LNCS (LNAI), vol. 9195, pp. 311\u2013325. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21401-6_21"},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1613\/jair.5714","volume":"61","author":"R Evans","year":"2018","unstructured":"Evans, R., Grefenstette, E.: Learning explanatory rules from noisy data. J. Artif. Intell. Res. 61, 1\u201364 (2018). https:\/\/doi.org\/10.1613\/jair.5714","journal-title":"J. Artif. Intell. Res."},{"issue":"2","key":"17_CR16","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.: Removing redundancy from a clause. Artif. Intell. 61(2), 263\u2013289 (1993)","journal-title":"Artif. Intell."},{"key":"17_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1007\/BFb0020821","volume-title":"STACS 91","author":"E Gr\u00e4del","year":"1991","unstructured":"Gr\u00e4del, E.: The expressive power of second order Horn logic. In: Choffrut, C., Jantzen, M. (eds.) STACS 1991. LNCS, vol. 480, pp. 466\u2013477. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/BFb0020821"},{"key":"17_CR18","unstructured":"Hemaspaandra, E., Schnoor, H.: Minimization for generalized Boolean formulas. In: IJCAI Proceedings-International Joint Conference on Artificial Intelligence, vol. 22, p. 566 (2011)"},{"key":"17_CR19","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.: Clause elimination for SAT and QSAT. J. Artif. Intell. Res. 53, 127\u2013168 (2015)","journal-title":"J. Artif. Intell. Res."},{"key":"17_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-642-37651-1_7","volume-title":"Programming Logics","author":"T Hillenbrand","year":"2013","unstructured":"Hillenbrand, T., Piskac, R., Waldmann, U., Weidenbach, C.: From search to computation: redundancy criteria and simplification at work. In: Voronkov, A., Weidenbach, C. (eds.) Programming Logics. LNCS, vol. 7797, pp. 169\u2013193. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37651-1_7"},{"key":"17_CR21","unstructured":"Hohenecker, P., Lukasiewicz, T.: Deep learning for ontology reasoning. CoRR abs\/1705.10342 (2017)"},{"key":"17_CR22","unstructured":"Huet, G.P.: A mechanization of type theory. In: Proceedings of the 3rd International Joint Conference on Artificial Intelligence, pp. 139\u2013146 (1973)"},{"key":"17_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0539-5","volume-title":"Descriptive Complexity","author":"N Immerman","year":"2012","unstructured":"Immerman, N.: Descriptive Complexity. Springer, New York (2012). https:\/\/doi.org\/10.1007\/978-1-4612-0539-5"},{"issue":"3","key":"17_CR24","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1145\/321958.321960","volume":"23","author":"WH Joyner Jr","year":"1976","unstructured":"Joyner Jr., W.H.: Resolution strategies as decision procedures. J. ACM 23(3), 398\u2013417 (1976). https:\/\/doi.org\/10.1145\/321958.321960","journal-title":"J. ACM"},{"key":"17_CR25","doi-asserted-by":"crossref","unstructured":"Kaminski, T., Eiter, T., Inoue, K.: Exploiting answer set programming with external sources for meta-interpretive learning. In: 34th International Conference on Logic Programming (2018)","DOI":"10.29007\/drn9"},{"key":"17_CR26","unstructured":"Kowalski, R.A.: Predicate logic as programming language. In: IFIP Congress, pp. 569\u2013574 (1974)"},{"key":"17_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-642-02029-2_6","volume-title":"Graph Theory, Computational Intelligence and Thought","author":"M Langlois","year":"2009","unstructured":"Langlois, M., Mubayi, D., Sloan, R.H., Tur\u00e1n, G.: Combinatorial problems for Horn clauses. In: Lipshteyn, M., Levit, V.E., McConnell, R.M. (eds.) Graph Theory, Computational Intelligence and Thought. LNCS, vol. 5420, pp. 54\u201365. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02029-2_6"},{"issue":"2","key":"17_CR28","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.: Redundancy in logic I: CNF propositional formulae. Artif. Intell. 163(2), 203\u2013232 (2005). https:\/\/doi.org\/10.1016\/j.artint.2004.11.002","journal-title":"Artif. Intell."},{"issue":"2\u20133","key":"17_CR29","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.: Redundancy in logic II: 2CNF and Horn propositional formulae. Artif. Intell. 172(2\u20133), 265\u2013299 (2008). https:\/\/doi.org\/10.1016\/j.artint.2007.06.003","journal-title":"Artif. Intell."},{"key":"17_CR30","series-title":"COGTECH","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-08406-9","volume-title":"Logic for Learning","author":"J Lloyd","year":"2003","unstructured":"Lloyd, J.: Logic for Learning. COGTECH. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-662-08406-9"},{"key":"17_CR31","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-94-017-1737-3","volume-title":"Handbook of Defeasible Reasoning and Uncertainty Management Systems","author":"P Marquis","year":"2000","unstructured":"Marquis, P.: Consequence finding algorithms. In: Kohlas, J., Moral, S. (eds.) Handbook of Defeasible Reasoning and Uncertainty Management Systems, pp. 41\u2013145. Springer, Dordrecht (2000). https:\/\/doi.org\/10.1007\/978-94-017-1737-3"},{"key":"17_CR32","doi-asserted-by":"crossref","unstructured":"McCarthy, J.: Making robots conscious of their mental states. In: Machine Intelligence 15, Intelligent Agents, July 1995, pp. 3\u201317. St. Catherine\u2019s College, Oxford (1995)","DOI":"10.1016\/0921-8890(95)00011-4"},{"issue":"4","key":"17_CR33","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF03037089","volume":"8","author":"S Muggleton","year":"1991","unstructured":"Muggleton, S.: Inductive logic programming. New Gener. Comput. 8(4), 295\u2013318 (1991)","journal-title":"New Gener. Comput."},{"key":"17_CR34","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/BF03037227","volume":"13","author":"S Muggleton","year":"1995","unstructured":"Muggleton, S.: Inverse entailment and Progol. New Gener. Comput. 13, 245\u2013286 (1995)","journal-title":"New Gener. Comput."},{"issue":"1","key":"17_CR35","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10994-014-5471-y","volume":"100","author":"S Muggleton","year":"2015","unstructured":"Muggleton, S., Lin, D., Tamaddoni-Nezhad, A.: Meta-interpretive learning of higher-order dyadic datalog: predicate invention revisited. Mach. Learn. 100(1), 49\u201373 (2015)","journal-title":"Mach. Learn."},{"issue":"1","key":"17_CR36","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10994-011-5259-2","volume":"86","author":"S Muggleton","year":"2012","unstructured":"Muggleton, S., et al.: ILP turns 20 - biography and future challenges. Mach. Learn. 86(1), 3\u201323 (2012). https:\/\/doi.org\/10.1007\/s10994-011-5259-2","journal-title":"Mach. Learn."},{"key":"17_CR37","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-62927-0","volume-title":"Foundations of Inductive Logic Programming","author":"SH Nienhuys-Cheng","year":"1997","unstructured":"Nienhuys-Cheng, S.H., De Wolf, R.: Foundations of Inductive Logic Programming. Springer, New York (1997). https:\/\/doi.org\/10.1007\/3-540-62927-0"},{"key":"17_CR38","unstructured":"Plotkin, G.: Automatic methods of inductive inference. Ph.D. thesis, Edinburgh University, August 1971"},{"key":"17_CR39","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/978-3-642-34106-9_2","volume-title":"Lecture Notes in Computer Science","author":"Luc De Raedt","year":"2012","unstructured":"Raedt, L.D.: Declarative modeling for machine learning and data mining. In: Proceedings of Algorithmic Learning Theory - 23rd International Conference, ALT, p. 12 (2012). https:\/\/doi.org\/10.1007\/978-3-642-34106-9_2"},{"key":"17_CR40","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BF00992861","volume":"8","author":"LD Raedt","year":"1992","unstructured":"Raedt, L.D., Bruynooghe, M.: Interactive concept-learning and constructive induction by analogy. Mach. Learn. 8, 107\u2013150 (1992). https:\/\/doi.org\/10.1007\/BF00992861","journal-title":"Mach. Learn."},{"issue":"1","key":"17_CR41","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/321250.321253","volume":"12","author":"JA Robinson","year":"1965","unstructured":"Robinson, J.A.: A machine-oriented logic based on the resolution principle. J. ACM 12(1), 23\u201341 (1965). https:\/\/doi.org\/10.1145\/321250.321253","journal-title":"J. ACM"},{"key":"17_CR42","unstructured":"Rockt\u00e4schel, T., Riedel, S.: End-to-end differentiable proving. In: Guyon, I., et al. (eds.) Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, pp. 3791\u20133803 (2017)"},{"issue":"1","key":"17_CR43","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0304-3975(92)90287-P","volume":"105","author":"T Sato","year":"1992","unstructured":"Sato, T.: Equivalence-preserving first-order unfold\/fold transformation systems. Theor. Comput. Sci. 105(1), 57\u201384 (1992). https:\/\/doi.org\/10.1016\/0304-3975(92)90287-P","journal-title":"Theor. Comput. Sci."},{"key":"17_CR44","doi-asserted-by":"publisher","unstructured":"Si, X., Lee, W., Zhang, R., Albarghouthi, A., Koutris, P., Naik, M.: Syntax-guided synthesis of datalog programs. In: Leavens, G.T., Garcia, A., Pasareanu, C.S. (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, pp. 515\u2013527. ACM (2018). https:\/\/doi.org\/10.1145\/3236024.3236034","DOI":"10.1145\/3236024.3236034"},{"issue":"2","key":"17_CR45","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF01932293","volume":"17","author":"S T\u00e4rnlund","year":"1977","unstructured":"T\u00e4rnlund, S.: Horn clause computability. BIT 17(2), 215\u2013226 (1977)","journal-title":"BIT"},{"key":"17_CR46","unstructured":"Tourret, S., Cropper, A.: SLD-resolution reduction of second-order Horn fragments. Technical report (2018). https:\/\/arxiv.org\/abs\/1902.09900"},{"key":"17_CR47","doi-asserted-by":"crossref","unstructured":"Wang, W.Y., Mazaitis, K., Cohen, W.W.: Structure learning via parameter learning. In: Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management, pp. 1199\u20131208. ACM (2014)","DOI":"10.1145\/2661829.2662022"},{"issue":"2\u20133","key":"17_CR48","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.: Subterm contextual rewriting. AI Commun. 23(2\u20133), 97\u2013109 (2010). https:\/\/doi.org\/10.3233\/AIC-2010-0459","journal-title":"AI Commun."}],"container-title":["Lecture Notes in Computer Science","Logics in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-19570-0_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,24]],"date-time":"2019-11-24T12:16:50Z","timestamp":1574597810000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-19570-0_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030195694","9783030195700"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-19570-0_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"6 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"JELIA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Logics in Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rende","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"jelia2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/jelia2019.mat.unical.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}