{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,30]],"date-time":"2025-08-30T16:36:17Z","timestamp":1756571777342,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,7,12]],"date-time":"2023-07-12T00:00:00Z","timestamp":1689120000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP190103894","FT200100536"],"award-info":[{"award-number":["DP190103894","FT200100536"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,7,15]]},"DOI":"10.1145\/3583131.3590517","type":"proceedings-article","created":{"date-parts":[[2023,7,12]],"date-time":"2023-07-12T19:40:19Z","timestamp":1689190819000},"page":"938-945","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Evolutionary Diversity Optimisation in Constructing Satisfying Assignments"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6928-1029","authenticated-orcid":false,"given":"Adel","family":"Nikfarjam","sequence":"first","affiliation":[{"name":"Optimisation and Logistics \/ the School of Computer and Mathematical Science, The University of Adelaide, Adelaide, SA, Australia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4133-2437","authenticated-orcid":false,"given":"Ralf","family":"Rothenberger","sequence":"additional","affiliation":[{"name":"Chair for Algorithm Engineering, Hasso Plattner Institute, Potsdom, Brandenburg, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2721-3618","authenticated-orcid":false,"given":"Frank","family":"Neumann","sequence":"additional","affiliation":[{"name":"Optimisation and Logistics \/ the School of Computer and Mathematical Science, The University of Adelaide, Adelaide, SA, Australia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0076-6308","authenticated-orcid":false,"given":"Tobias","family":"Friedrich","sequence":"additional","affiliation":[{"name":"Chair for Algorithm Engineering, Hasso Plattner Institute, Potsdom, Brandenburg, Germany"}]}],"member":"320","published-online":{"date-parts":[[2023,7,12]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Bradley Alexander James Kortman and Aneta Neumann. 2017. Evolution of artistic image variants through feature based diversity optimisation. In GECCO. ACM 171--178. Bradley Alexander James Kortman and Aneta Neumann. 2017. Evolution of artistic image variants through feature based diversity optimisation. In GECCO. ACM 171--178.","DOI":"10.1145\/3071178.3071342"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Maxime Allard Sim\u00f3n C. Smith Konstantinos I. Chatzilygeroudis and Antoine Cully. 2022. Hierarchical quality-diversity for online damage recovery. In GECCO. ACM 58--67. Maxime Allard Sim\u00f3n C. Smith Konstantinos I. Chatzilygeroudis and Antoine Cully. 2022. Hierarchical quality-diversity for online damage recovery. In GECCO. ACM 58--67.","DOI":"10.1145\/3512290.3528751"},{"key":"e_1_3_2_1_3_1","volume-title":"Maria Luisa Bonet, and Jordi Levy","author":"Ans\u00f3tegui Carlos","year":"2009","unstructured":"Carlos Ans\u00f3tegui , Maria Luisa Bonet, and Jordi Levy . 2009 . Towards IndustrialLike Random SAT Instances. In IJCAI. 387--392. Carlos Ans\u00f3tegui, Maria Luisa Bonet, and Jordi Levy. 2009. Towards IndustrialLike Random SAT Instances. In IJCAI. 387--392."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299904.3340307"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Jakob Bossek Aneta Neumann and Frank Neumann. 2021. Breeding diverse packings for the knapsack problem by means of diversity-tailored evolutionary algorithms. In GECCO. ACM 556--564. Jakob Bossek Aneta Neumann and Frank Neumann. 2021. Breeding diverse packings for the knapsack problem by means of diversity-tailored evolutionary algorithms. In GECCO. ACM 556--564.","DOI":"10.1145\/3449639.3459364"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Jakob Bossek and Frank Neumann. 2021. Evolutionary diversity optimization and the minimum spanning tree problem. In GECCO. ACM 198--206. Jakob Bossek and Frank Neumann. 2021. Evolutionary diversity optimization and the minimum spanning tree problem. In GECCO. ACM 198--206.","DOI":"10.1145\/3449639.3459363"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Jakob Bossek and Frank Neumann. 2022. Exploring the feature space of TSP instances using quality diversity. In GECCO. ACM 186--194. Jakob Bossek and Frank Neumann. 2022. Exploring the feature space of TSP instances using quality diversity. In GECCO. ACM 186--194.","DOI":"10.1145\/3512290.3528851"},{"key":"e_1_3_2_1_8_1","volume-title":"Vardi","author":"Chakraborty Supratik","year":"2015","unstructured":"Supratik Chakraborty , Daniel J. Fremont , Kuldeep S. Meel , Sanjit A. Seshia , and Moshe Y . Vardi . 2015 . On Parallel Scalable Uniform SAT Witness Generation. In TACAS (Lecture Notes in Computer Science , Vol. 9035). Springer, 304-- 319 . Supratik Chakraborty, Daniel J. Fremont, Kuldeep S. Meel, Sanjit A. Seshia, and Moshe Y. Vardi. 2015. On Parallel Scalable Uniform SAT Witness Generation. In TACAS (Lecture Notes in Computer Science, Vol. 9035). Springer, 304--319."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Stephen A. Cook. 1971. The Complexity of Theorem-Proving Procedures. In STOC. ACM 151--158. Stephen A. Cook. 1971. The Complexity of Theorem-Proving Procedures. In STOC. ACM 151--158.","DOI":"10.1145\/800157.805047"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/368273.368557"},{"key":"e_1_3_2_1_11_1","unstructured":"Anh Viet Do Jakob Bossek Aneta Neumann and Frank Neumann. 2020. Evolving diverse sets of tours for the travelling salesperson problem. In GECCO. ACM 681--689. Anh Viet Do Jakob Bossek Aneta Neumann and Frank Neumann. 2020. Evolving diverse sets of tours for the travelling salesperson problem. In GECCO. ACM 681--689."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3561974"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Rafael Dutra Kevin Laeufer Jonathan Bachrach and Koushik Sen. 2018. Efficient sampling of SAT solutions for testing. In ICSE. ACM 549--559. Rafael Dutra Kevin Laeufer Jonathan Bachrach and Koushik Sen. 2018. Efficient sampling of SAT solutions for testing. In ICSE. ACM 549--559.","DOI":"10.1145\/3180155.3180248"},{"key":"e_1_3_2_1_14_1","volume-title":"SAT (Lecture Notes in Computer Science","volume":"518","author":"E\u00e9n Niklas","year":"2003","unstructured":"Niklas E\u00e9n and Niklas S\u00f6rensson . 2003 . An Extensible SAT-solver . In SAT (Lecture Notes in Computer Science , Vol. 2919). Springer, 502-- 518 . Niklas E\u00e9n and Niklas S\u00f6rensson. 2003. An Extensible SAT-solver. In SAT (Lecture Notes in Computer Science, Vol. 2919). Springer, 502--518."},{"volume-title":"Illuminating Mario Scenes in the Latent Space of a Generative Adversarial Network","author":"Fontaine Matthew C.","key":"e_1_3_2_1_15_1","unstructured":"Matthew C. Fontaine , Ruilin Liu , Ahmed Khalifa , Jignesh Modi , Julian Togelius , Amy K. Hoover , and Stefanos Nikolaidis . 2021. Illuminating Mario Scenes in the Latent Space of a Generative Adversarial Network . In AAAI. AAAI Press , 5922--5930. Matthew C. Fontaine, Ruilin Liu, Ahmed Khalifa, Jignesh Modi, Julian Togelius, Amy K. Hoover, and Stefanos Nikolaidis. 2021. Illuminating Mario Scenes in the Latent Space of a Generative Adversarial Network. In AAAI. AAAI Press, 5922--5930."},{"key":"e_1_3_2_1_16_1","volume-title":"Hoover","author":"Fontaine Matthew C.","year":"2020","unstructured":"Matthew C. Fontaine , Julian Togelius , Stefanos Nikolaidis , and Amy K . Hoover . 2020 . Covariance matrix adaptation for the rapid illumination of behavior space. In GECCO. ACM , 94--102. Matthew C. Fontaine, Julian Togelius, Stefanos Nikolaidis, and Amy K. Hoover. 2020. Covariance matrix adaptation for the rapid illumination of behavior space. In GECCO. ACM, 94--102."},{"key":"e_1_3_2_1_17_1","first-page":"1","article-title":"Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT. In ESA (LIPIcs, Vol. 87)","volume":"37","author":"Friedrich Tobias","year":"2017","unstructured":"Tobias Friedrich , Anton Krohmer , Ralf Rothenberger , Thomas Sauerwald , and Andrew M. Sutton . 2017 . Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT. In ESA (LIPIcs, Vol. 87) . Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik , 37 : 1 -- 37 :15. Tobias Friedrich, Anton Krohmer, Ralf Rothenberger, Thomas Sauerwald, and Andrew M. Sutton. 2017. Bounds on the Satisfiability Threshold for Power Law Distributed Random SAT. In ESA (LIPIcs, Vol. 87). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 37:1--37:15.","journal-title":"Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik"},{"key":"e_1_3_2_1_18_1","volume-title":"Sutton","author":"Friedrich Tobias","year":"2017","unstructured":"Tobias Friedrich , Anton Krohmer , Ralf Rothenberger , and Andrew M . Sutton . 2017 . Phase Transitions for Scale-Free SAT Formulas. In AAAI. AAAI Press , 3893--3899. Tobias Friedrich, Anton Krohmer, Ralf Rothenberger, and Andrew M. Sutton. 2017. Phase Transitions for Scale-Free SAT Formulas. In AAAI. AAAI Press, 3893--3899."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco_a_00274"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2016.2638437"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/378239.379017"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-21581-0_23"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Aneta Neumann Denis Antipov and Frank Neumann. 2022. Coevolutionary Pareto diversity optimization. In GECCO. ACM 832--839. Aneta Neumann Denis Antipov and Frank Neumann. 2022. Coevolutionary Pareto diversity optimization. In GECCO. ACM 832--839.","DOI":"10.1145\/3512290.3528755"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"Aneta Neumann Jakob Bossek and Frank Neumann. 2021. Diversifying greedy sampling and evolutionary diversity optimisation for constrained monotone submodular functions. In GECCO. ACM 261--269. Aneta Neumann Jakob Bossek and Frank Neumann. 2021. Diversifying greedy sampling and evolutionary diversity optimisation for constrained monotone submodular functions. In GECCO. ACM 261--269.","DOI":"10.1145\/3449639.3459385"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Aneta Neumann Wanru Gao Carola Doerr Frank Neumann and Markus Wagner. 2018. Discrepancy-based evolutionary diversity optimization. In GECCO. ACM 991--998. Aneta Neumann Wanru Gao Carola Doerr Frank Neumann and Markus Wagner. 2018. Discrepancy-based evolutionary diversity optimization. In GECCO. ACM 991--998.","DOI":"10.1145\/3205455.3205532"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","unstructured":"Aneta Neumann Wanru Gao Markus Wagner and Frank Neumann. 2019. Evolutionary diversity optimization using multi-objective indicators. In GECCO. ACM 837--845. Aneta Neumann Wanru Gao Markus Wagner and Frank Neumann. 2019. Evolutionary diversity optimization using multi-objective indicators. In GECCO. ACM 837--845.","DOI":"10.1145\/3321707.3321796"},{"key":"e_1_3_2_1_27_1","first-page":"1","article-title":"Computing diverse sets of high quality TSP tours by EAX-based evolutionary diversity optimisation","volume":"9","author":"Nikfarjam Adel","year":"2021","unstructured":"Adel Nikfarjam , Jakob Bossek , Aneta Neumann , and Frank Neumann . 2021 . Computing diverse sets of high quality TSP tours by EAX-based evolutionary diversity optimisation . In FOGA. ACM , 9 : 1 -- 9 :11. Adel Nikfarjam, Jakob Bossek, Aneta Neumann, and Frank Neumann. 2021. Computing diverse sets of high quality TSP tours by EAX-based evolutionary diversity optimisation. In FOGA. ACM, 9:1--9:11.","journal-title":"FOGA. ACM"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"Adel Nikfarjam Jakob Bossek Aneta Neumann and Frank Neumann. 2021. Entropy-based evolutionary diversity optimisation for the traveling salesperson problem. In GECCO. ACM 600--608. Adel Nikfarjam Jakob Bossek Aneta Neumann and Frank Neumann. 2021. Entropy-based evolutionary diversity optimisation for the traveling salesperson problem. In GECCO. ACM 600--608.","DOI":"10.1145\/3449639.3459384"},{"key":"e_1_3_2_1_29_1","volume-title":"Anh Viet Do, and Frank Neumann","author":"Nikfarjam Adel","year":"2022","unstructured":"Adel Nikfarjam , Anh Viet Do, and Frank Neumann . 2022 . Analysis of Quality Diversity Algorithms for the Knapsack Problem. In PPSN (2) (Lecture Notes in Computer Science , Vol. 13399). Springer, 413-- 427 . Adel Nikfarjam, Anh Viet Do, and Frank Neumann. 2022. Analysis of Quality Diversity Algorithms for the Knapsack Problem. In PPSN (2) (Lecture Notes in Computer Science, Vol. 13399). Springer, 413--427."},{"volume-title":"PPSN (1) (Lecture Notes in Computer Science","author":"Nikfarjam Adel","key":"e_1_3_2_1_30_1","unstructured":"Adel Nikfarjam , Amirhossein Moosavi , Aneta Neumann , and Frank Neumann . 2022. Computing High-Quality Solutions for the Patient Admission Scheduling Problem Using Evolutionary Diversity Optimisation . In PPSN (1) (Lecture Notes in Computer Science , Vol. 13398). Springer, 250-- 264 . Adel Nikfarjam, Amirhossein Moosavi, Aneta Neumann, and Frank Neumann. 2022. Computing High-Quality Solutions for the Patient Admission Scheduling Problem Using Evolutionary Diversity Optimisation. In PPSN (1) (Lecture Notes in Computer Science, Vol. 13398). Springer, 250--264."},{"volume-title":"PPSN (1) (Lecture Notes in Computer Science","author":"Nikfarjam Adel","key":"e_1_3_2_1_31_1","unstructured":"Adel Nikfarjam , Aneta Neumann , Jakob Bossek , and Frank Neumann . 2022. Co-evolutionary Diversity Optimisation for the Traveling Thief Problem . In PPSN (1) (Lecture Notes in Computer Science , Vol. 13398). Springer, 237-- 249 . Adel Nikfarjam, Aneta Neumann, Jakob Bossek, and Frank Neumann. 2022. Co-evolutionary Diversity Optimisation for the Traveling Thief Problem. In PPSN (1) (Lecture Notes in Computer Science, Vol. 13398). Springer, 237--249."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","unstructured":"Adel Nikfarjam Aneta Neumann and Frank Neumann. 2022. Evolutionary diversity optimisation for the traveling thief problem. In GECCO. ACM 749--756. Adel Nikfarjam Aneta Neumann and Frank Neumann. 2022. Evolutionary diversity optimisation for the traveling thief problem. In GECCO. ACM 749--756.","DOI":"10.1145\/3512290.3528862"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","unstructured":"Adel Nikfarjam Aneta Neumann and Frank Neumann. 2022. On the use of quality diversity algorithms for the traveling thief problem. In GECCO. ACM 260--268. Adel Nikfarjam Aneta Neumann and Frank Neumann. 2022. On the use of quality diversity algorithms for the traveling thief problem. In GECCO. ACM 260--268.","DOI":"10.1145\/3512290.3528752"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"crossref","unstructured":"Nemanja Rakicevic Antoine Cully and Petar Kormushev. 2021. Policy manifold search: exploring the manifold hypothesis for diversity-based neuroevolution. In GECCO. ACM 901--909. Nemanja Rakicevic Antoine Cully and Petar Kormushev. 2021. Policy manifold search: exploring the manifold hypothesis for diversity-based neuroevolution. In GECCO. ACM 901--909.","DOI":"10.1145\/3449639.3459320"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.769433"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"crossref","unstructured":"Kirby Steckel and Jacob Schrum. 2021. Illuminating the space of beatable lode runner levels produced by various generative adversarial networks. In GECCO Companion. ACM 111--112. Kirby Steckel and Jacob Schrum. 2021. Illuminating the space of beatable lode runner levels produced by various generative adversarial networks. In GECCO Companion. ACM 111--112.","DOI":"10.1145\/3449726.3459440"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"crossref","unstructured":"Tamara Ulrich and Lothar Thiele. 2011. Maximizing population diversity in single-objective optimization. In GECCO. ACM 641--648. Tamara Ulrich and Lothar Thiele. 2011. Maximizing population diversity in single-objective optimization. In GECCO. ACM 641--648.","DOI":"10.1145\/2001576.2001665"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"crossref","unstructured":"Enrico Zardini Davide Zappetti Davide Zambrano Giovanni Iacca and Dario Floreano. 2021. Seeking quality diversity in evolutionary co-design of morphology and control of soft tensegrity modular robots. In GECCO. ACM 189--197. Enrico Zardini Davide Zappetti Davide Zambrano Giovanni Iacca and Dario Floreano. 2021. Seeking quality diversity in evolutionary co-design of morphology and control of soft tensegrity modular robots. In GECCO. ACM 189--197.","DOI":"10.1145\/3449639.3459311"}],"event":{"name":"GECCO '23: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Lisbon Portugal","acronym":"GECCO '23"},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583131.3590517","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3583131.3590517","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:44Z","timestamp":1750178264000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583131.3590517"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,12]]},"references-count":38,"alternative-id":["10.1145\/3583131.3590517","10.1145\/3583131"],"URL":"https:\/\/doi.org\/10.1145\/3583131.3590517","relation":{},"subject":[],"published":{"date-parts":[[2023,7,12]]},"assertion":[{"value":"2023-07-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}