{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T20:35:46Z","timestamp":1743021346255,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030974534"},{"type":"electronic","value":"9783030974541"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-97454-1_11","type":"book-chapter","created":{"date-parts":[[2022,2,23]],"date-time":"2022-02-23T20:02:28Z","timestamp":1645646548000},"page":"156-166","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Programmatic Policy Extraction by Iterative Local Search"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9177-2695","authenticated-orcid":false,"given":"Rasmus","family":"Larsen","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6927-8869","authenticated-orcid":false,"given":"Mikkel N\u00f8rgaard","family":"Schmidt","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,2,24]]},"reference":[{"key":"11_CR1","unstructured":"Bastani, O., Pu, Y., Solar-Lezama, A.: Verifiable reinforcement learning via policy extraction, May 2018. http:\/\/arxiv.org\/abs\/1805.08328"},{"key":"11_CR2","unstructured":"Ellis, K., Morales, L., Meyer, M.S., Solar-Lezama, A., Tenenbaum, J.B.: DREAMCODER: bootstrapping domain-specific languages for neurally-guided Bayesian program learning. In: Neural Abstract Machines & Program Induction Workshop at NIPS (2018)"},{"key":"11_CR3","unstructured":"Fujimoto, S., van Hoof, H., Meger, D.: Addressing function approximation error in actor-critic methods, February 2018. http:\/\/arxiv.org\/abs\/1802.09477"},{"key":"11_CR4","unstructured":"Gupta, K., Christensen, P.E., Chen, X., Song, D.: Synthesize, execute and debug: learning to repair for neural program synthesis. In: Advances in Neural Information Processing Systems, July 2020. http:\/\/arxiv.org\/abs\/2007.08095"},{"key":"11_CR5","unstructured":"van Hasselt, H.P., Hessel, M., Aslanides, J.: When to use parametric models in reinforcement learning? In: Wallach, H., Larochelle, H., Beygelzimer, A., d\u2019 Alch\u00e9-Buc, F., Fox, E., Garnett, R. (eds.) Advances in Neural Information Processing Systems, vol. 32. Curran Associates, Inc. (2019)"},{"key":"11_CR6","unstructured":"Hein, D., Udluft, S., Runkler, T.A.: Interpretable policies for reinforcement learning by genetic programming, December 2017. http:\/\/arxiv.org\/abs\/1712.04170"},{"key":"11_CR7","unstructured":"Inala, J.P., Bastani, O., Tavares, Z., Solar-Lezama, A.: Synthesizing programmatic policies that inductively generalize. In: International Conference on Learning Representations (ICLR) (2020)"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1007\/3-540-45105-6_59","volume-title":"Genetic and Evolutionary Computation \u2014 GECCO 2003","author":"S Kamio","year":"2003","unstructured":"Kamio, S., Mitsuhashi, H., Iba, H.: Integration of genetic programming and reinforcement learning for real robots. In: Cant\u00fa-Paz, E., et al. (eds.) GECCO 2003. LNCS, vol. 2723, pp. 470\u2013482. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-45105-6_59"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-540-89197-0_21","volume-title":"PRICAI 2008: Trends in Artificial Intelligence","author":"S Katayama","year":"2008","unstructured":"Katayama, S.: Efficient exhaustive generation of functional programs using Monte-Carlo search with iterative deepening. In: Ho, T.-B., Zhou, Z.-H. (eds.) PRICAI 2008. LNCS (LNAI), vol. 5351, pp. 199\u2013210. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-89197-0_21"},{"key":"11_CR10","doi-asserted-by":"publisher","unstructured":"Pisinger, D., Ropke, S.: Large Neighborhood Search, pp. 399\u2013419. Springer, US (2010). https:\/\/doi.org\/10.1007\/978-1-4419-1665-5_13","DOI":"10.1007\/978-1-4419-1665-5_13"},{"key":"11_CR11","unstructured":"Ross, S., Gordon, G.J., Bagnell, J.A.: A reduction of imitation learning and structured prediction to No-Regret online learning, November 2010"},{"key":"11_CR12","doi-asserted-by":"publisher","unstructured":"Salomon, R.: The deterministic genetic algorithm: implementation details and some results. In: Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406). IEEE (2003). https:\/\/doi.org\/10.1109\/cec.1999.782001","DOI":"10.1109\/cec.1999.782001"},{"key":"11_CR13","unstructured":"Verma, A., Le, H., Yue, Y., Chaudhuri, S.: Imitation-projected programmatic reinforcement learning. In: Wallach, H., Larochelle, H., Beygelzimer, A., d\u00c1lch\u00e9-Buc, F., Fox, E., Garnett, R. (eds.) Advances in Neural Information Processing Systems, vol. 32, pp. 15752\u201315763. Curran Associates, Inc. (2019)"},{"key":"11_CR14","unstructured":"Verma, A., Murali, V., Singh, R., Kohli, P., Chaudhuri, S.: Programmatically interpretable reinforcement learning, April 2018. http:\/\/arxiv.org\/abs\/1804.02477"}],"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-030-97454-1_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,23]],"date-time":"2022-02-23T20:03:56Z","timestamp":1645646636000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-97454-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030974534","9783030974541"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-97454-1_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"24 February 2022","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ilp2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/lr2020.iit.demokritos.gr\/","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":"10","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":"16","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":"3","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":"160% - 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)"}}]}}