{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T18:15:59Z","timestamp":1783102559894,"version":"3.54.6"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032090867","type":"print"},{"value":"9783032090874","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T00:00:00Z","timestamp":1763683200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T00:00:00Z","timestamp":1763683200000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-09087-4_1","type":"book-chapter","created":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T18:21:19Z","timestamp":1763662879000},"page":"3-18","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Inventing Recursive Predicates by\u00a0Sampling and\u00a0Folding Deduced and\u00a0Abduced Atoms"],"prefix":"10.1007","author":[{"given":"Taosheng","family":"Qiu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ryutaro","family":"Ichise","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,11,21]]},"reference":[{"key":"1_CR1","unstructured":"Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley (1995)"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Afrati, F., Papadimitriou, C.: The parallel complexity of simple chain queries. In: Proceedings of the Sixth ACM Symposium on Principles of Database Systems, pp. 210\u2013213. Association for Computing Machinery (1987)","DOI":"10.1145\/28659.28682"},{"issue":"1","key":"1_CR3","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/S0304-3975(02)00730-2","volume":"308","author":"F Afrati","year":"2003","unstructured":"Afrati, F., Gergatsoulis, M., Toni, F.: Linearisability on datalog programs. Theoret. Comput. Sci. 308(1), 199\u2013226 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Cropper, A., Duman\u010di\u0107, S., Muggleton, S.H.: Turning 30: new ideas in inductive logic programming. In: Proceedings of the 29th International Joint Conference on Artificial Intelligence, pp. 4833\u20134839 (2020)","DOI":"10.24963\/ijcai.2020\/673"},{"issue":"4","key":"1_CR5","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":"1_CR6","unstructured":"Cropper, A., Morel, R.: Predicate invention by learning from failures. arxiv:2104.14426 (2021)"},{"issue":"7","key":"1_CR7","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1007\/s10994-019-05862-7","volume":"109","author":"A Cropper","year":"2019","unstructured":"Cropper, A., Morel, R., Muggleton, S.: Learning higher-order logic programs. Mach. Learn. 109(7), 1289\u20131322 (2019). https:\/\/doi.org\/10.1007\/s10994-019-05862-7","journal-title":"Mach. Learn."},{"issue":"1","key":"1_CR8","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/200836.200838","volume":"42","author":"T Eiter","year":"1995","unstructured":"Eiter, T., Gottlob, G.: The complexity of logic-based abduction. J. ACM 42(1), 3\u201342 (1995)","journal-title":"J. ACM"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Gal\u00e1rraga, L.A., Teflioudi, C., Hose, K., Suchanek, F.: Amie: association rule mining under incomplete evidence in ontological knowledge bases. In: Proceedings of the 22nd International Conference on World Wide Web, pp. 413\u2013422 (2013)","DOI":"10.1145\/2488388.2488425"},{"issue":"15","key":"1_CR10","first-page":"429","volume":"7","author":"E Kitzelmann","year":"2006","unstructured":"Kitzelmann, E., Schmid, U.: Inductive synthesis of functional programs: an explanation based generalization approach. J. Mach. Learn. Res. 7(15), 429\u2013454 (2006)","journal-title":"J. Mach. Learn. Res."},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Lajus, J., Gal\u00e1rraga, L., Suchanek, F.: Fast and exact rule mining with amie 3. In: The Semantic Web, pp. 36\u201352 (2020)","DOI":"10.1007\/978-3-030-49461-2_3"},{"key":"1_CR12","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s10994-010-5205-8","volume":"81","author":"N Lao","year":"2010","unstructured":"Lao, N., Cohen, W.: Relational retrieval using a combination of path-constrained random walks. Mach. Learn. 81, 53\u201367 (2010)","journal-title":"Mach. Learn."},{"issue":"5\u20136","key":"1_CR13","doi-asserted-by":"publisher","first-page":"834","DOI":"10.1017\/S1471068416000351","volume":"16","author":"M Law","year":"2016","unstructured":"Law, M., Russo, A., Broda, K.: Iterative learning of answer set programs from context dependent examples. Theory Pract. Logic Program. 16(5\u20136), 834\u2013848 (2016)","journal-title":"Theory Pract. Logic Program."},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Mendelson, J., Naik, A., Raghothaman, M., Naik, M.: GenSynth: synthesizing datalog programs without language bias. In: Proceedings of the AAAI Conference on Artificial Intelligence, pp. 6444\u20136453 (2021)","DOI":"10.1609\/aaai.v35i7.16799"},{"issue":"3\u20134","key":"1_CR15","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. N. Gener. Comput. 13(3\u20134), 245\u2013286 (1995)","journal-title":"N. Gener. Comput."},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Muggleton, S., Buntine, W.L.: Machine invention of first order predicates by inverting resolution. In: Proceedings of the 5th International Conference on Machine Learning, pp. 339\u2013352 (1988)","DOI":"10.1016\/B978-0-934613-64-4.50040-2"},{"key":"1_CR17","unstructured":"Muggleton, S.H., Feng, C.: Efficient induction of logic programs. In: Proceedings of International Conference on Algorithmic Learning Theory, pp. 368\u2013381 (1990)"},{"issue":"3","key":"1_CR18","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1023\/A:1022699322624","volume":"5","author":"JR Quinlan","year":"1990","unstructured":"Quinlan, J.R.: Learning logical definitions from relations. Mach. Learn. 5(3), 239\u2013266 (1990)","journal-title":"Mach. Learn."},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Raghothaman, M., Mendelson, J., Zhao, D., Naik, M., Scholz, B.: Provenance-guided synthesis of datalog programs. In: Proceedings of the ACM on Programming Languages, pp. 1\u201327 (2019)","DOI":"10.1145\/3371130"},{"issue":"1\u20132","key":"1_CR20","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/0743-1066(93)90021-8","volume":"16","author":"H Seki","year":"1993","unstructured":"Seki, H.: Unfold\/fold transformation of general logic programs for the well-founded semantics. J. Log. Program. 16(1\u20132), 5\u201323 (1993)","journal-title":"J. Log. Program."},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"Thakkar, A., Naik, A., Sands, N., Alur, R., Naik, M., Raghothaman, M.: Example-guided synthesis of relational queries. In: Proceedings of the 42nd International Conference on Programming Language Design and Implementation, pp. 1110\u20131125 (2021)","DOI":"10.1145\/3453483.3454098"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Thakkar, A., Sands, N., Petrou, G., Alur, R., Naik, M., Raghothaman, M.: Mobius: synthesizing relational queries with recursive and invented predicates. In: Proceedings of the ACM on Programming Languages, pp. 1394\u20131417 (2023)","DOI":"10.1145\/3622847"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Ullman, J.D., Van\u00a0Gelder, A.: Parallel complexity of logical query programs. In: 27th Annual Symposium on Foundations of Computer Science, pp. 438\u2013454 (1986)","DOI":"10.1109\/SFCS.1986.40"}],"container-title":["Lecture Notes in Computer Science","Learning and Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-09087-4_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T17:26:22Z","timestamp":1783099582000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-09087-4_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,21]]},"ISBN":["9783032090867","9783032090874"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-09087-4_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,21]]},"assertion":[{"value":"21 November 2025","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 Joint Conference on Learning and Reasoning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nanjing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"33","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ilp2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.lamda.nju.edu.cn\/ijclr24\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}