{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,22]],"date-time":"2026-07-22T06:03:43Z","timestamp":1784700223199,"version":"3.55.0"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032331946","type":"print"},{"value":"9783032331953","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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-33195-3_3","type":"book-chapter","created":{"date-parts":[[2026,7,22]],"date-time":"2026-07-22T05:24:19Z","timestamp":1784697859000},"page":"22-37","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Resource-Bounded Incremental Induction: A Principled Framework for\u00a0Continual Learning"],"prefix":"10.1007","author":[{"given":"Daniel","family":"MacDonald","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,23]]},"reference":[{"key":"3_CR1","doi-asserted-by":"publisher","unstructured":"Bowers, M., et al.: Top-down synthesis for library learning. In: Proceedings of the ACM on Programming Languages 7(POPL), 1182\u20131213 (2023). https:\/\/doi.org\/10.1145\/3571234, http:\/\/arxiv.org\/abs\/2211.16605","DOI":"10.1145\/3571234"},{"key":"3_CR2","doi-asserted-by":"publisher","unstructured":"Ellis, K., et al.: DreamCoder: growing generalizable, interpretable knowledge with wake-sleep Bayesian program learning. Philos. Trans. Royal Soc. A: Math. Phys. Eng. Sci. 381(2251) (2020). https:\/\/doi.org\/10.1098\/rsta.2022.0050, https:\/\/arxiv.org\/pdf\/2006.08381","DOI":"10.1098\/rsta.2022.0050"},{"key":"3_CR3","doi-asserted-by":"publisher","unstructured":"Franz, A.: On hierarchical compression and power laws in nature. In: Artificial General Intelligence (AGI 2017). LNCS, vol. 10414, pp. 77\u201386. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63703-7_8","DOI":"10.1007\/978-3-319-63703-7_8"},{"key":"3_CR4","doi-asserted-by":"publisher","unstructured":"Franz, A., Antonenko, O., Soletskyi, R.: A theory of incremental compression. Inf. Sci. 547, 28\u201348 (2021). https:\/\/doi.org\/10.1016\/j.ins.2020.08.035","DOI":"10.1016\/j.ins.2020.08.035"},{"key":"3_CR5","doi-asserted-by":"publisher","unstructured":"Franz, A., Gogulya, V., L\u00f6ffler, M.: WILLIAM: a monolithic approach to AGI. In: Artificial General Intelligence (AGI 2019). LNCS, vol. 11654, pp. 44\u201358. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-27005-6_5","DOI":"10.1007\/978-3-030-27005-6_5"},{"key":"3_CR6","doi-asserted-by":"publisher","unstructured":"Grand, G., et al.: LILO: learning interpretable libraries by compressing and documenting code. In: International Conference on Learning Representations (2023). https:\/\/doi.org\/10.48550\/ARXIV.2310.19791","DOI":"10.48550\/ARXIV.2310.19791"},{"key":"3_CR7","unstructured":"Levin, L.A.: Universal sequential search problems. Probl. Inf. Trans. 9(3), 265\u2013266 (1973). https:\/\/www.mathnet.ru\/eng\/ppi914"},{"key":"3_CR8","doi-asserted-by":"publisher","unstructured":"Li, M., Vit\u00e1nyi, P.M.B.: An introduction to kolmogorov complexity and its applications. Springer (2008). https:\/\/doi.org\/10.1007\/978-0-387-49820-1.3edn","DOI":"10.1007\/978-0-387-49820-1.3edn"},{"key":"3_CR9","doi-asserted-by":"publisher","unstructured":"Parisi, G.I., Kemker, R., Part, J.L., Kanan, C., Wermter, S.: Continual lifelong learning with neural networks: a review. Neural Netw. 113, 54\u201371 (2019). https:\/\/doi.org\/10.1016\/j.neunet.2019.01.012","DOI":"10.1016\/j.neunet.2019.01.012"},{"key":"3_CR10","doi-asserted-by":"publisher","unstructured":"Rissanen, J.: Modeling by shortest data description. Automatica 14(5), 465\u2013471 (1978). https:\/\/doi.org\/10.1016\/0005-1098(78)90005-5","DOI":"10.1016\/0005-1098(78)90005-5"},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1023\/B:MACH.0000015880.99707.b2","volume":"54","author":"J Schmidhuber","year":"2004","unstructured":"Schmidhuber, J.: Optimal ordered problem solver. Mach. Learn. 54, 211\u2013254 (2004). https:\/\/doi.org\/10.1023\/B:MACH.0000015880.99707.b2","journal-title":"Mach. Learn."},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0019-9958(64)90223-2","volume":"7","author":"RJ Solomonoff","year":"1964","unstructured":"Solomonoff, R.J.: A formal theory of inductive inference. Inf. Control 7, 1\u201322 (1964)","journal-title":"Inf. Control"},{"key":"3_CR13","doi-asserted-by":"publisher","unstructured":"Wang, L., Zhang, X., Su, H., Zhu, J.: A comprehensive survey of continual learning: theory, method and application. IEEE Trans. Pattern Anal. Mach. Intell. 46(08), 5362\u20135383 (2024). https:\/\/doi.org\/10.1109\/TPAMI.2024.3367329","DOI":"10.1109\/TPAMI.2024.3367329"}],"container-title":["Lecture Notes in Computer Science","Artificial General Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-33195-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,22]],"date-time":"2026-07-22T05:24:20Z","timestamp":1784697860000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-33195-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032331946","9783032331953"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-33195-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"23 July 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AGI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Artificial General Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"San Francisco","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 July 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 July 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"agi2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/agi-conf.org\/2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}