{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T02:25:51Z","timestamp":1743128751612,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031569562"},{"type":"electronic","value":"9783031569579"}],"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-56957-9_2","type":"book-chapter","created":{"date-parts":[[2024,3,28]],"date-time":"2024-03-28T00:04:24Z","timestamp":1711584264000},"page":"21-37","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Generational Computation Reduction in\u00a0Informal Counterexample-Driven Genetic Programming"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2330-6809","authenticated-orcid":false,"given":"Thomas","family":"Helmuth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0535-5268","authenticated-orcid":false,"given":"Edward","family":"Pantridge","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-9549-1485","authenticated-orcid":false,"given":"James Gunder","family":"Frazier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5299-4797","authenticated-orcid":false,"given":"Lee","family":"Spector","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,3,28]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","unstructured":"B\u0142\u0105dek, I., Krawiec, K.: Solving symbolic regression problems with formal constraints. In: GECCO 2019: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 977\u2013984. ACM, Prague (2019). https:\/\/doi.org\/10.1145\/3321707.3321743","DOI":"10.1145\/3321707.3321743"},{"issue":"5","key":"2_CR2","doi-asserted-by":"publisher","first-page":"1327","DOI":"10.1109\/TEVC.2022.3205286","volume":"27","author":"I B\u0142\u0105dek","year":"2023","unstructured":"B\u0142\u0105dek, I., Krawiec, K.: Counterexample-driven genetic programming for symbolic regression with formal constraints. IEEE Trans. Evol. Comput. 27(5), 1327\u20131339 (2023). https:\/\/doi.org\/10.1109\/TEVC.2022.3205286","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"2_CR3","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1162\/evco_a_00228","volume":"26","author":"I B\u0142\u0105dek","year":"2018","unstructured":"B\u0142\u0105dek, I., Krawiec, K., Swan, J.: Counterexample-driven genetic programming: heuristic program synthesis from formal specifications. Evol. Comput. 26(3), 441\u2013469 (2018). https:\/\/doi.org\/10.1162\/evco_a_00228","journal-title":"Evol. Comput."},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Boldi, R., et al.: The problem solving benefits of down-sampling vary by selection scheme. In: Proceedings of the Companion Conference on Genetic and Evolutionary Computation, pp. 527\u2013530 (2023)","DOI":"10.1145\/3583133.3590713"},{"key":"2_CR5","doi-asserted-by":"publisher","unstructured":"Boldi, R., et al.: Informed down-sampled lexicase selection: identifying productive training cases for efficient problem solving (2023). https:\/\/doi.org\/10.48550\/arXiv.2301.01488, arXiv:2301.01488","DOI":"10.48550\/arXiv.2301.01488"},{"key":"2_CR6","doi-asserted-by":"publisher","unstructured":"Boldi, R., Lalejini, A., Helmuth, T., Spector, L.: A static analysis of informed down-samples. In: Proceedings of the Companion Conference on Genetic and Evolutionary Computation, GECCO 2023 Companion, pp. 531\u2013534. Association for Computing Machinery, New York (2023). https:\/\/doi.org\/10.1145\/3583133.3590751","DOI":"10.1145\/3583133.3590751"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Dreossi, T., Ghosh, S., Yue, X., Keutzer, K., Sangiovanni-Vincentelli, A., Seshia, S.A.: Counterexample-guided data augmentation (2018)","DOI":"10.24963\/ijcai.2018\/286"},{"key":"2_CR8","series-title":"Genetic and Evolutionary Computation","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-39958-0_1","volume-title":"Genetic Programming Theory and Practice XVII","author":"AJ Ferguson","year":"2020","unstructured":"Ferguson, A.J., Hernandez, J.G., Junghans, D., Lalejini, A., Dolson, E., Ofria, C.: Characterizing the effects of random subsampling on lexicase selection. In: Banzhaf, W., Goodman, E., Sheneman, L., Trujillo, L., Worzel, B. (eds.) Genetic Programming Theory and Practice XVII. GEC, pp. 1\u201323. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-39958-0_1"},{"key":"2_CR9","doi-asserted-by":"publisher","unstructured":"Helmuth, T., Frazier, J.G., Shi, Y., Abdelrehim, A.F.: Human-driven genetic programming for program synthesis: a prototype. In: Proceedings of the Companion Conference on Genetic and Evolutionary Computation, GECCO 2023 Companion, pp. 1981\u20131989. Association for Computing Machinery, New York (2023). https:\/\/doi.org\/10.1145\/3583133.3596373","DOI":"10.1145\/3583133.3596373"},{"key":"2_CR10","doi-asserted-by":"publisher","unstructured":"Helmuth, T., McPhee, N.F., Pantridge, E., Spector, L.: Improving generalization of evolved programs through automatic simplification. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2017, pp. 937\u2013944. ACM, Berlin (2017). https:\/\/doi.org\/10.1145\/3071178.3071330, http:\/\/doi.acm.org\/10.1145\/3071178.3071330","DOI":"10.1145\/3071178.3071330"},{"key":"2_CR11","doi-asserted-by":"publisher","unstructured":"Helmuth, T., McPhee, N.F., Spector, L.: Effects of lexicase and tournament selection on diversity recovery and maintenance. In: GECCO 2016 Companion: Proceedings of the Companion Publication of the 2016 Annual Conference on Genetic and Evolutionary Computation, pp. 983\u2013990. ACM, Denver (2016). https:\/\/doi.org\/10.1145\/2908961.2931657, http:\/\/doi.acm.org\/10.1145\/2908961.2931657","DOI":"10.1145\/2908961.2931657"},{"key":"2_CR12","doi-asserted-by":"publisher","unstructured":"Helmuth, T., McPhee, N.F., Spector, L.: The impact of hyperselection on lexicase selection. In: Friedrich, T. (ed.) GECCO 2016: Proceedings of the 2016 Annual Conference on Genetic and Evolutionary Computation, pp. 717\u2013724. ACM, Denver (2016). https:\/\/doi.org\/10.1145\/2908812.2908851","DOI":"10.1145\/2908812.2908851"},{"key":"2_CR13","doi-asserted-by":"publisher","unstructured":"Helmuth, T., McPhee, N.F., Spector, L.: Program synthesis using uniform mutation by addition and deletion. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2018, pp. 1127\u20131134. ACM, Kyoto (2018). https:\/\/doi.org\/10.1145\/3205455.3205603, http:\/\/doi.acm.org\/10.1145\/3205455.3205603","DOI":"10.1145\/3205455.3205603"},{"key":"2_CR14","doi-asserted-by":"publisher","unstructured":"Helmuth, T., Spector, L.: General program synthesis benchmark suite. In: GECCO 2015: Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation, pp. 1039\u20131046. ACM, Madrid (2015). https:\/\/doi.org\/10.1145\/2739480.2754769, http:\/\/doi.acm.org\/10.1145\/2739480.2754769","DOI":"10.1145\/2739480.2754769"},{"key":"2_CR15","doi-asserted-by":"publisher","unstructured":"Helmuth, T., Spector, L.: Explaining and exploiting the advantages of down-sampled lexicase selection. In: Artificial Life Conference Proceedings, pp. 341\u2013349. MIT Press (2020). https:\/\/doi.org\/10.1162\/isal_a_00334, https:\/\/www.mitpressjournals.org\/doi\/abs\/10.1162\/isal_a_00334","DOI":"10.1162\/isal_a_00334"},{"issue":"3\u20134","key":"2_CR16","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1162\/artl_a_00341","volume":"27","author":"T Helmuth","year":"2022","unstructured":"Helmuth, T., Spector, L.: Problem-solving benefits of down-sampled lexicase selection. Artif. Life 27(3\u20134), 183\u2013203 (2022). https:\/\/doi.org\/10.1162\/artl_a_00341","journal-title":"Artif. Life"},{"key":"2_CR17","doi-asserted-by":"publisher","unstructured":"Helmuth, T., Spector, L., Matheson, J.: Solving uncompromising problems with lexicase selection. IEEE Trans. Evol. Comput. 19(5), 630\u2013643 (2015). https:\/\/doi.org\/10.1109\/TEVC.2014.2362729, http:\/\/ieeexplore.ieee.org\/stamp\/stamp.jsp?tp= &arnumber=6920034","DOI":"10.1109\/TEVC.2014.2362729"},{"key":"2_CR18","doi-asserted-by":"publisher","unstructured":"Helmuth, T., Spector, L., Pantridge, E.: Counterexample-driven genetic programming without formal specifications. In: Proceedings of the 2020 Genetic and Evolutionary Computation Conference Companion, GECCO 2020, pp. 239\u2013240. ACM (2020). https:\/\/doi.org\/10.1145\/3377929.3389983","DOI":"10.1145\/3377929.3389983"},{"key":"2_CR19","doi-asserted-by":"publisher","unstructured":"Hernandez, J.G., Lalejini, A., Dolson, E., Ofria, C.: Random subsampling improves performance in lexicase selection. In: GECCO 2019: Proceedings of the Genetic and Evolutionary Computation Conference Companion, pp. 2028\u20132031. ACM, Prague (2019). https:\/\/doi.org\/10.1145\/3319619.3326900","DOI":"10.1145\/3319619.3326900"},{"key":"2_CR20","series-title":"Genetic and Evolutionary Computation","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-981-16-8113-4_5","volume-title":"Genetic Programming Theory and Practice XVIII","author":"JG Hernandez","year":"2022","unstructured":"Hernandez, J.G., Lalejini, A., Ofria, C.: An exploration of exploration: measuring the ability of lexicase selection to find obscure pathways to optimality. In: Banzhaf, W., Trujillo, L., Winkler, S., Worzel, B. (eds.) Genetic Programming Theory and Practice XVIII. Genetic and Evolutionary Computation, pp. 83\u2013107. Springer, Singapore (2022). https:\/\/doi.org\/10.1007\/978-981-16-8113-4_5"},{"key":"2_CR21","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley (1979)"},{"key":"2_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1007\/978-3-642-15871-1_48","volume-title":"Parallel Problem Solving from Nature, PPSN XI","author":"D Jackson","year":"2010","unstructured":"Jackson, D.: Promoting phenotypic diversity in genetic programming. In: Schaefer, R., Cotta, C., Ko\u0142odziej, J., Rudolph, G. (eds.) PPSN 2010. LNCS, vol. 6239, pp. 472\u2013481. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15871-1_48"},{"key":"2_CR23","doi-asserted-by":"publisher","unstructured":"Krawiec, K., B\u0142\u0105dek, I., Swan, J.: Counterexample-driven genetic programming. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2017, pp. 953\u2013960. ACM, Berlin (2017). https:\/\/doi.org\/10.1145\/3071178.3071224, http:\/\/doi.acm.org\/10.1145\/3071178.3071224","DOI":"10.1145\/3071178.3071224"},{"key":"2_CR24","doi-asserted-by":"publisher","unstructured":"Krawiec, K., B\u0142\u0105dek, I., Swan, J., Drake, J.H.: Counterexample-driven genetic programming: stochastic synthesis of provably correct programs. In: Lang, J. (ed.) Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (IJCAI-18), pp. 5304\u20135308. International Joint Conferences on Artificial Intelligence, Stockholm (2018). https:\/\/doi.org\/10.24963\/ijcai.2018\/742, https:\/\/www.ijcai.org\/proceedings\/2018\/742","DOI":"10.24963\/ijcai.2018\/742"},{"key":"2_CR25","doi-asserted-by":"publisher","unstructured":"Moore, J.M., Stanton, A.: Lexicase selection outperforms previous strategies for incremental evolution of virtual creature controllers. In: Proceedings of the European Conference on Artificial Life, pp. 290\u2013297 (2017). https:\/\/doi.org\/10.1162\/ecal_a_0050_14, https:\/\/www.mitpressjournals.org\/doi\/abs\/10.1162\/ecal_a_0050_14","DOI":"10.1162\/ecal_a_0050_14"},{"key":"2_CR26","doi-asserted-by":"publisher","unstructured":"Moore, J.M., Stanton, A.: Tiebreaks and diversity: isolating effects in lexicase selection. In: The 2018 Conference on Artificial Life, pp. 590\u2013597 (2018). https:\/\/doi.org\/10.1162\/isal_a_00109, https:\/\/www.mitpressjournals.org\/doi\/abs\/10.1162\/isal_a_00109","DOI":"10.1162\/isal_a_00109"},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"Rice, H.G.: Classes of recursively enumerable sets and their decision problems. Trans. Am. Math. Soc. 74(2), 358\u2013366 (1953). http:\/\/www.jstor.org\/stable\/1990888","DOI":"10.1090\/S0002-9947-1953-0053041-6"},{"key":"2_CR28","doi-asserted-by":"publisher","unstructured":"Schweim, D., Sobania, D., Rothlauf, F.: Effects of the training set size: a comparison of standard and down-sampled lexicase selection in program synthesis. In: 2022 IEEE Congress on Evolutionary Computation (CEC), pp. 1\u20138 (2022). https:\/\/doi.org\/10.1109\/CEC55065.2022.9870337","DOI":"10.1109\/CEC55065.2022.9870337"},{"key":"2_CR29","unstructured":"Sivaraman, A., Farnadi, G., Millstein, T., den Broeck, G.V.: Counterexample-guided learning of monotonic neural networks (2020)"},{"key":"2_CR30","doi-asserted-by":"crossref","unstructured":"Sobania, D., Briesch, M., R\u00f6chner, P., Rothlauf, F.: MTGP: combining metamorphic testing and genetic programming (2023)","DOI":"10.1007\/978-3-031-29573-7_21"},{"key":"2_CR31","doi-asserted-by":"publisher","unstructured":"Spector, L., Klein, J., Keijzer, M.: The push3 execution stack and the evolution of control. In: GECCO 2005: Proceedings of the 2005 conference on Genetic and evolutionary computation, vol. 2, pp. 1689\u20131696. ACM Press, Washington DC (2005). https:\/\/doi.org\/10.1145\/1068009.1068292, http:\/\/www.cs.bham.ac.uk\/wbl\/biblio\/gecco2005\/docs\/p1689.pdf","DOI":"10.1145\/1068009.1068292"},{"key":"2_CR32","doi-asserted-by":"publisher","unstructured":"Welsch, T., Kurlin, V.: Synthesis through unification genetic programming. In: Proceedings of the 2020 Genetic and Evolutionary Computation Conference, GECCO 2020, pp. 1029\u20131036. Association for Computing Machinery, New York (2020). https:\/\/doi.org\/10.1145\/3377930.3390208, https:\/\/doi.org\/10.1145\/3377930.3390208","DOI":"10.1145\/3377930.3390208 10.1145\/3377930.3390208"}],"container-title":["Lecture Notes in Computer Science","Genetic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-56957-9_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,28]],"date-time":"2024-03-28T00:04:48Z","timestamp":1711584288000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-56957-9_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031569562","9783031569579"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-56957-9_2","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":"28 March 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EuroGP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Genetic Programming (Part of EvoStar)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Aberystwyth","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 April 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 April 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurogp2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.evostar.org\/2024\/eurogp\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"24","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":"13","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":"54% - 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.666","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.447","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)"}}]}}