{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T07:59:27Z","timestamp":1743148767493,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319999593"},{"type":"electronic","value":"9783319999609"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-99960-9_1","type":"book-chapter","created":{"date-parts":[[2018,8,23]],"date-time":"2018-08-23T08:57:34Z","timestamp":1535014654000},"page":"1-21","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Derivation Reduction of Metarules in\u00a0Meta-interpretive Learning"],"prefix":"10.1007","author":[{"given":"Andrew","family":"Cropper","sequence":"first","affiliation":[]},{"given":"Sophie","family":"Tourret","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,24]]},"reference":[{"key":"1_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":"1_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74113-8","volume-title":"The Calculus of Computation: Decision Procedures with Applications to Verification","author":"AR Bradley","year":"2007","unstructured":"Bradley, A.R., Manna, Z.: The Calculus of Computation: Decision Procedures with Applications to Verification. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74113-8"},{"key":"1_CR3","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":"1_CR4","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, pp. 1418\u20131424. IJCAI\/AAAI Press, New York (2016)"},{"key":"1_CR5","unstructured":"Cropper, A., Muggleton, S.H.: Metagol system (2016). https:\/\/github.com\/metagol\/metagol"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Cropper, A., Muggleton, S.H.: Learning efficient logic programs. Mach. Learn., 1\u201321 (2018)","DOI":"10.1007\/s10994-018-5712-6"},{"key":"1_CR7","unstructured":"Emde, W., Habel, C., Rollinger, C.-R.: The discovery of the equator or concept driven learning. In: Bundy, A. (ed.) Proceedings of the 8th International Joint Conference on Artificial Intelligence, August 1983, pp. 455\u2013458. William Kaufmann, Karlsruhe (1983)"},{"key":"1_CR8","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)","journal-title":"J. Artif. Intell. Res."},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/3-540-63494-0_55","volume-title":"Inductive Logic Programming","author":"P Flener","year":"1997","unstructured":"Flener, P.: Inductive logic program synthesis with DIALOGS. In: Muggleton, S. (ed.) ILP 1996. LNCS, vol. 1314, pp. 175\u2013198. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-63494-0_55"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-540-30109-7_13","volume-title":"Inductive Logic Programming","author":"N Fonseca","year":"2004","unstructured":"Fonseca, N., Costa, V.S., Silva, F., Camacho, R.: On avoiding redundancy in inductive logic programming. In: Camacho, R., King, R., Srinivasan, A. (eds.) ILP 2004. LNCS (LNAI), vol. 3194, pp. 132\u2013146. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30109-7_13"},{"key":"1_CR11","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.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)"},{"key":"1_CR12","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":"1_CR13","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":"1_CR14","unstructured":"Kietz, J.-U., Wrobel, S.: Controlling the complexity of learning in logic through syntactic and task-oriented models. In: Inductive Logic Programming. Citeseer (1992)"},{"key":"1_CR15","unstructured":"Kowalski, R.A.: Predicate logic as programming language. In: IFIP Congress, pp. 569\u2013574 (1974)"},{"key":"1_CR16","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"},{"key":"1_CR17","first-page":"38","volume":"63","author":"J Larson","year":"1977","unstructured":"Larson, J., Michalski, R.S.: Inductive inference of VL decision rules. SIGART Newslett. 63, 38\u201344 (1977)","journal-title":"SIGART Newslett."},{"issue":"2","key":"1_CR18","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)","journal-title":"Artif. Intell."},{"issue":"2\u20133","key":"1_CR19","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)","journal-title":"Artif. Intell."},{"key":"1_CR20","unstructured":"Lin, D., Dechter, E., Ellis, K., Tenenbaum, J.B., Muggleton, S.: Bias reformulation for one-shot function induction. In: ECAI 2014\u201321st European Conference on Artificial Intelligence, 18\u201322 August 2014, Prague, Czech Republic - Including Prestigious Applications of Intelligent Systems (PAIS 2014), pp. 525\u2013530 (2014)"},{"key":"1_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of Logic Programming","author":"JW Lloyd","year":"2012","unstructured":"Lloyd, J.W.: Foundations of Logic Programming. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-83189-8"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Marcinkowski, J., Pacholski, L.: 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 (1992)","DOI":"10.1109\/SFCS.1992.267755"},{"issue":"3&4","key":"1_CR23","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(3&4), 245\u2013286 (1995)","journal-title":"New Gener. Comput."},{"key":"1_CR24","unstructured":"Muggleton, S., Feng, C.: Efficient induction of logic programs. In: Algorithmic Learning Theory, First International Workshop, ALT 1990, Tokyo, Japan, 8\u201310 October 1990, Proceedings, pp. 368\u2013381 (1990)"},{"issue":"1","key":"1_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.: Meta-interpretive learning of higher-order dyadic datalog: predicate invention revisited. Mach. Learn. 100(1), 49\u201373 (2015)","journal-title":"Mach. Learn."},{"key":"1_CR26","series-title":"Lecture Notes in Computer Science","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.: Foundations of Inductive Logic Programming. LNCS, vol. 1228. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-62927-0"},{"key":"1_CR27","unstructured":"Plotkin, G.D.: Automatic methods of inductive inference. Ph.D. thesis, Edinburgh University, August 1971"},{"key":"1_CR28","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/978-3-642-34106-9_2","volume-title":"Algorithmic Learning Theory","author":"L Raedt","year":"2012","unstructured":"Raedt, L.: Declarative modeling for machine learning and data mining. In: Bshouty, N.H., Stoltz, G., Vayatis, N., Zeugmann, T. (eds.) ALT 2012. LNCS (LNAI), vol. 7568, pp. 12\u201312. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34106-9_2"},{"key":"1_CR29","first-page":"107","volume":"8","author":"L Raedt De","year":"1992","unstructured":"De Raedt, L., Bruynooghe, M.: Interactive concept-learning and constructive induction by analogy. Mach. Learn. 8, 107\u2013150 (1992)","journal-title":"Mach. Learn."},{"key":"1_CR30","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.: Implication of clauses is undecidable. Theor. Comput. Sci. 59, 287\u2013296 (1988)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR31","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.: Algorithmic Program Debugging. MIT Press, Cambridge (1983)"},{"key":"1_CR32","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"}],"container-title":["Lecture Notes in Computer Science","Inductive Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-99960-9_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,9]],"date-time":"2024-07-09T14:26:49Z","timestamp":1720535209000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-99960-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319999593","9783319999609"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-99960-9_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"ILP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Inductive Logic Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ferrara","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 September 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ilp2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ilp2018.unife.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"24","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"10","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"42% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"2.83","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"-","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}