{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,3]],"date-time":"2025-09-03T10:33:30Z","timestamp":1756895610008,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031492983"},{"type":"electronic","value":"9783031492990"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-49299-0_4","type":"book-chapter","created":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T05:06:49Z","timestamp":1703135209000},"page":"46-61","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Learning Strategies of\u00a0Inductive Logic Programming Using Reinforcement Learning"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-4183-0058","authenticated-orcid":false,"given":"Takeru","family":"Isobe","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2717-9122","authenticated-orcid":false,"given":"Katsumi","family":"Inoue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,22]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Cropper, A.: Forgetting to learn logic programs. In: AAAI, pp. 3676\u20133683. AAAI Press (2020)","DOI":"10.1609\/aaai.v34i04.5776"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1613\/jair.1.13507","volume":"74","author":"A Cropper","year":"2022","unstructured":"Cropper, A., Dumancic, S.: Inductive logic programming at 30: a new introduction. J. Artif. Intell. Res. 74, 765\u2013850 (2022)","journal-title":"J. Artif. Intell. Res."},{"issue":"4","key":"4_CR3","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1007\/s10994-020-05934-z","volume":"110","author":"A Cropper","year":"2021","unstructured":"Cropper, A., Morel, R.: Learning programs by learning from failures. Mach. Learn. 110(4), 801\u2013856 (2021). https:\/\/doi.org\/10.1007\/s10994-020-05934-z","journal-title":"Mach. Learn."},{"key":"4_CR4","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":"4_CR5","doi-asserted-by":"crossref","unstructured":"Cropper, A., Tourret, S.: Logical reduction of metarules. CoRR abs\/1907.10952 (2019)","DOI":"10.1007\/s10994-019-05834-x"},{"key":"4_CR6","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":"4_CR7","doi-asserted-by":"crossref","unstructured":"Fran\u00e7ois-Lavet, V., Henderson, P., Islam, R., Bellemare, M.G., Pineau, J.: An introduction to deep reinforcement learning. CoRR abs\/1811.12560 (2018)","DOI":"10.1561\/9781680835397"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Gao, K., Inoue, K., Cao, Y., Wang, H.: Learning first-order rules with differentiable logic program semantics. In: IJCAI, pp. 3008\u20133014. ijcai.org (2022)","DOI":"10.24963\/ijcai.2022\/417"},{"issue":"9","key":"4_CR9","first-page":"5149","volume":"44","author":"TM Hospedales","year":"2022","unstructured":"Hospedales, T.M., Antoniou, A., Micaelli, P., Storkey, A.J.: Meta-learning in neural networks: a survey. IEEE Trans. Pattern Anal. Mach. Intell. 44(9), 5149\u20135169 (2022)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"2","key":"4_CR10","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1023\/B:MACH.0000023149.72125.e2","volume":"55","author":"K Inoue","year":"2004","unstructured":"Inoue, K.: Induction as consequence finding. Mach. Learn. 55(2), 109\u2013135 (2004)","journal-title":"Mach. Learn."},{"issue":"3\u20134","key":"4_CR11","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1017\/S1471068418000261","volume":"18","author":"T Kaminski","year":"2018","unstructured":"Kaminski, T., Eiter, T., Inoue, K.: Exploiting answer set programming with external sources for meta-interpretive learning. Theory Pract. Log. Program. 18(3\u20134), 571\u2013588 (2018)","journal-title":"Theory Pract. Log. Program."},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Law, M., Russo, A., Bertino, E., Broda, K., Lobo, J.: FastLAS: scalable inductive logic programming incorporating domain-specific optimisation criteria. In: AAAI, pp. 2877\u20132885. AAAI Press (2020)","DOI":"10.1609\/aaai.v34i03.5678"},{"key":"4_CR13","unstructured":"Lin, D., Dechter, E., Ellis, K., Tenenbaum, J.B., Muggleton, S.H.: Bias reformulation for one-shot function induction. In: ECAI. Frontiers in Artificial Intelligence and Applications, vol. 263, pp. 525\u2013530. IOS Press (2014)"},{"issue":"4","key":"4_CR14","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF03037089","volume":"8","author":"SH Muggleton","year":"1991","unstructured":"Muggleton, S.H.: Inductive logic programming. New Gener. Comput. 8(4), 295\u2013318 (1991)","journal-title":"New Gener. Comput."},{"issue":"3 &4","key":"4_CR15","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/BF03037227","volume":"13","author":"SH Muggleton","year":"1995","unstructured":"Muggleton, S.H.: Inverse entailment and progol. New Gener. Comput. 13(3 &4), 245\u2013286 (1995)","journal-title":"New Gener. Comput."},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Muggleton, S.H., Buntine, W.L.: Machine invention of first order predicates by inverting resolution. In: ML, pp. 339\u2013352. Morgan Kaufmann (1988)","DOI":"10.1016\/B978-0-934613-64-4.50040-2"},{"issue":"1","key":"4_CR17","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). https:\/\/doi.org\/10.1007\/s10994-014-5471-y","journal-title":"Mach. Learn."},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Shindo, H., Nishino, M., Yamamoto, A.: Differentiable inductive logic programming for structured examples. In: AAAI, pp. 5034\u20135041. AAAI Press (2021)","DOI":"10.1609\/aaai.v35i6.16637"},{"key":"4_CR19","series-title":"Machine Learning at the Computing Laboratory","volume-title":"The Aleph Manual","author":"A Srinivasan","year":"2001","unstructured":"Srinivasan, A.: The Aleph Manual. Machine Learning at the Computing Laboratory, Oxford University, Cambridge (2001)"},{"key":"4_CR20","first-page":"627","volume":"12","author":"A Srinivasan","year":"2011","unstructured":"Srinivasan, A., Ramakrishnan, G.: Parameter screening and optimisation for ILP using designed experiments. J. Mach. Learn. Res. 12, 627\u2013662 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"4_CR21","series-title":"Adaptive Computation and Machine Learning","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.1998.712192","volume-title":"Reinforcement Learning - An Introduction","author":"RS Sutton","year":"1998","unstructured":"Sutton, R.S., Barto, A.G.: Reinforcement Learning - An Introduction. Adaptive Computation and Machine Learning, MIT Press, Cambridge (1998)"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Thrun, S., Pratt, L.Y. (eds.): Learning to Learn. Springer, Heidelberg (1998)","DOI":"10.1007\/978-1-4615-5529-2"},{"key":"4_CR23","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/BF00992696","volume":"8","author":"RJ Williams","year":"1992","unstructured":"Williams, R.J.: Simple statistical gradient-following algorithms for connectionist reinforcement learning. Mach. Learn. 8, 229\u2013256 (1992)","journal-title":"Mach. Learn."},{"key":"4_CR24","unstructured":"Yang, F., Yang, Z., Cohen, W.W.: Differentiable learning of logical rules for knowledge base reasoning. In: NIPS, pp. 2319\u20132328 (2017)"}],"container-title":["Lecture Notes in Computer Science","Inductive Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49299-0_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T05:07:10Z","timestamp":1703135230000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49299-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031492983","9783031492990"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49299-0_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"22 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"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":"Bari","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 November 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ilp2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ilp2023.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 (provided by the conference organizers)"}},{"value":"https:\/\/easychair.org\/","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"18","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"61% - 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 (provided by the conference organizers)"}},{"value":"2.89","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.55","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1 late-breaking abstract only for oral presentation (not to be included in the conference proceedings)","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}