{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:29:19Z","timestamp":1743053359739,"version":"3.40.3"},"publisher-location":"Cham","reference-count":9,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031556296"},{"type":"electronic","value":"9783031556302"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-55630-2_3","type":"book-chapter","created":{"date-parts":[[2024,3,19]],"date-time":"2024-03-19T06:51:26Z","timestamp":1710831086000},"page":"25-39","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Program-Synthesis Challenge for\u00a0ARC-Like Tasks"],"prefix":"10.1007","author":[{"given":"Aditya","family":"Challa","sequence":"first","affiliation":[]},{"given":"Ashwin","family":"Srinivasan","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Bain","sequence":"additional","affiliation":[]},{"given":"Gautam","family":"Shroff","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,3,20]]},"reference":[{"key":"3_CR1","unstructured":"Acquaviva, S., et al.: Communicating natural programs to humans and machines. arXiv preprint arXiv:2106.07824 (2021)"},{"issue":"5","key":"3_CR2","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1145\/355592.365646","volume":"9","author":"C B\u00f6hm","year":"1966","unstructured":"B\u00f6hm, C., Jacopini, G.: Flow diagrams, turing machines and languages with only two formation rules. Commun. ACM 9(5), 366\u2013371 (1966)","journal-title":"Commun. ACM"},{"key":"3_CR3","unstructured":"Chollet, F.: On the measure of intelligence. CoRR abs\/1911.01547 (2019). http:\/\/arxiv.org\/abs\/1911.01547"},{"key":"3_CR4","doi-asserted-by":"publisher","unstructured":"Evans, T.G.: A heuristic program to solve geometric-analogy problems. In: Fischler, M.A., Firschein, O. (eds.) Readings in Computer Vision, pp. 444\u2013455. Morgan Kaufmann, San Francisco (1987). https:\/\/doi.org\/10.1016\/B978-0-08-051581-6.50046-5. https:\/\/www.sciencedirect.com\/science\/article\/pii\/B9780080515816500465","DOI":"10.1016\/B978-0-08-051581-6.50046-5"},{"key":"3_CR5","doi-asserted-by":"publisher","unstructured":"Lau, T.A., Domingos, P.M., Weld, D.S.: Learning programs from traces using version space algebra. In: Gennari, J.H., Porter, B.W., Gil, Y. (eds.) Proceedings of the 2nd International Conference on Knowledge Capture (K-CAP 2003), 23\u201325 October 2003, Sanibel Island, FL, USA, pp. 36\u201343. ACM (2003). https:\/\/doi.org\/10.1145\/945645.945654","DOI":"10.1145\/945645.945654"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Muggleton, S.H., Raedt, L.D.: Inductive logic programming: theory and methods. J. Log. Program. 19\/20, 629\u2013679 (1994). https:\/\/doi.org\/10.1016\/0743-1066(94)90035-3","DOI":"10.1016\/0743-1066(94)90035-3"},{"key":"3_CR7","doi-asserted-by":"publisher","unstructured":"Najman, L., Talbot, H.: Mathematical Morphology: from theory to applications, 520 p. ISTE-Wiley (2010). ISBN 9781848212152. https:\/\/hal-upec-upem.archives-ouvertes.fr\/hal-00622479. https:\/\/doi.org\/10.1002\/9781118600788","DOI":"10.1002\/9781118600788"},{"key":"3_CR8","doi-asserted-by":"publisher","unstructured":"Soille, P.: Morphological Image Analysis. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-662-05088-0","DOI":"10.1007\/978-3-662-05088-0"},{"key":"3_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-011-1040-2","volume-title":"Mathematical Morphology and Its Applications to Image Processing","year":"1994","unstructured":"Soille, P., Serra, J. (eds.): Mathematical Morphology and Its Applications to Image Processing. Springer, Dordrecht (1994). https:\/\/doi.org\/10.1007\/978-94-011-1040-2"}],"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-55630-2_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,19]],"date-time":"2024-03-19T06:51:44Z","timestamp":1710831104000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-55630-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031556296","9783031556302"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-55630-2_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"20 March 2024","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":"Windsor Great Park","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ilp2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ijclr22.doc.ic.ac.uk\/ilp2022.html\/index.html","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","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":"0","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":"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 (provided by the conference organizers)"}},{"value":"3","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","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)"}}]}}