{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T02:01:01Z","timestamp":1760148061658,"version":"build-2065373602"},"reference-count":33,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2023,3,24]],"date-time":"2023-03-24T00:00:00Z","timestamp":1679616000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001659","name":"German Science Foundation (DFG)","doi-asserted-by":"publisher","award":["HA 4463\/4","SCHA 550\/11"],"award-info":[{"award-number":["HA 4463\/4","SCHA 550\/11"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>We address the problem of evolutionary system design (ESD) by means of answer set programming modulo difference constraints (AMT). The goal of this design approach is to synthesize new product variants or generations from existing products. We start by formalizing the underlying system synthesis problem and design space exploration process, which consists of finding the Pareto front with respect to latency, cost, energy, and similarity measures between the two designs. We then present AMT-based encodings to capture all of these aspects. The idea is to use plain ASP for conflict detection and resolution and for routing and to use difference constraints for scheduling. Moreover, we propose a new approach for expressing the similarity that we use at three alternative levels of AMT-based design space exploration, namely, at the strategic, heuristic, and objective levels, which is performed to guide the exploration towards designs of high interest. Last but not least, we systematically evaluate the emerging techniques empirically and identify the most promising AMT techniques.<\/jats:p>","DOI":"10.3390\/a16040179","type":"journal-article","created":{"date-parts":[[2023,3,27]],"date-time":"2023-03-27T02:18:27Z","timestamp":1679883507000},"page":"179","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Evolutionary System Design with Answer Set Programming"],"prefix":"10.3390","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1568-5423","authenticated-orcid":false,"given":"Christian","family":"Haubelt","sequence":"first","affiliation":[{"name":"Applied Microelectronics and Computer Engineering, University of Rostock, 18051 Rostock, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3924-5852","authenticated-orcid":false,"given":"Luise","family":"M\u00fcller","sequence":"additional","affiliation":[{"name":"Applied Microelectronics and Computer Engineering, University of Rostock, 18051 Rostock, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4138-5114","authenticated-orcid":false,"given":"Kai","family":"Neubauer","sequence":"additional","affiliation":[{"name":"Bosch Sensortec GmbH, 01109 Dresden, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7456-041X","authenticated-orcid":false,"given":"Torsten","family":"Schaub","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Potsdam, 14482 Potsdam, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4986-4881","authenticated-orcid":false,"given":"Philipp","family":"Wanko","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Potsdam, 14482 Potsdam, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2023,3,24]]},"reference":[{"key":"ref_1","first-page":"2:1","article-title":"Theory Solving Made Easy with Clingo 5","volume":"Volume 52","author":"Carro","year":"2016","journal-title":"Proceedings of the Technical Communications of the Thirty-Second International Conference on Logic Programming (ICLP\u201916)"},{"key":"ref_2","unstructured":"Madsen, J., and Coskun, A. (2018, January 19\u201323). Exact Multi-Objective Design Space Exploration using ASPmT. Proceedings of the Twenty-first Conference on Design, Automation and Test in Europe (DATE\u201918), Dresden, Germany."},{"key":"ref_3","unstructured":"Albers, A., Bursac, N., and Wintergerst, E. (2015, January 15\u201317). Product Generation Development\u2014Importance and Challenges from a Design Research Perspective. Proceedings of the International Conference on Mechanical Engineering (ME 2015); Proceedings of the International Conference on Theoretical Mechanics and Applied Mechanics (TMAM 2015), Vienna, Austria."},{"key":"ref_4","unstructured":"M\u00fcller, L., Neubauer, K., and Haubelt, C. (2022). Embedded Computer Systems: Architectures, Modeling, and Simulation. SAMOS 2021, Springer International Publishing."},{"key":"ref_5","unstructured":"Warren, D., and Szeredi, P. (1990, January 18\u201322). Logic Programs with Classical Negation. Proceedings of the Seventh International Conference on Logic Programming (ICLP\u201990), Jerusalem, Israel."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/S0004-3702(02)00187-X","article-title":"Extending and implementing the stable model semantics","volume":"138","author":"Simons","year":"2002","journal-title":"Artif. Intell."},{"key":"ref_7","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Lindauer, M., Ostrowski, M., Romero, J., Schaub, T., and Thiele, S. (2015). Potassco User Guide, University of Potsdam. [2nd ed.]."},{"key":"ref_8","unstructured":"desJardins, M., and Littman, M. (2013, January 14\u201318). Domain-specific Heuristics in Answer Set Programming. Proceedings of the Twenty-Seventh National Conference on Artificial Intelligence (AAAI\u201913), Bellevue, WA, USA."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"63","DOI":"10.3233\/FI-2016-1398","article-title":"Answer Set Programming Modulo Acyclicity","volume":"147","author":"Bomanson","year":"2016","journal-title":"Fundam. Informaticae"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"872","DOI":"10.1017\/S1471068417000242","article-title":"Clingo goes Linear Constraints over Reals and Integers","volume":"17","author":"Janhunen","year":"2017","journal-title":"Theory Pract. Log. Program."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Benini, L., and De Micheli, G. (2006). Networks on Chips\u2014Technology and Tools, Elsevier Morgan Kaufmann.","DOI":"10.1016\/B978-012370521-1\/50002-3"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Pareto, V. (1964). Cours D\u2019economie Politique, Librairie Droz.","DOI":"10.3917\/droz.paret.1964.01"},{"key":"ref_13","unstructured":"Bonet, B., and Koenig, S. (2015, January 25\u201330). asprin: Customizing Answer Set Preferences without a Headache. Proceedings of the Twenty-Ninth National Conference on Artificial Intelligence (AAAI\u201915), Austin, TX, USA."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1017\/S1471068421000508","article-title":"How to Build Your Own ASP-based System?!","volume":"23","author":"Kaminski","year":"2023","journal-title":"Theory Pract. Log. Program."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1109\/TEVC.2003.810758","article-title":"Performance assessment of multiobjective optimizers: An analysis and review","volume":"7","author":"Zitzler","year":"2003","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_16","unstructured":"Shin, Y. (2018, January 22\u201325). Utilizing quad-trees for efficient design space exploration with partial assignment evaluation. Proceedings of the Twenty-Third Asia and South Pacific Design Automation Conference (ASP-DAC\u201918), Jeju, Republic of Korea."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/978-3-642-40564-8_9","article-title":"Symbolic System Synthesis Using Answer Set Programming","volume":"Volume 8148","author":"Cabalar","year":"2013","journal-title":"Proceedings of the Twelfth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR\u201913)"},{"key":"ref_18","unstructured":"Haubelt, C., and Timmermann, D. (2013). Sechzehnter Workshop f\u00fcr Methoden und Beschreibungssprachen zur Modellierung und Verifikation von Schaltungen und Systemen (MBMV\u201913), Institut f\u00fcr Angewandte Mikroelektronik und Datentechnik, Universit\u00e4t Rostock."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/978-3-319-23264-5_6","article-title":"Improving Coordinated SMT-based System Synthesis by Utilizing Domain-specific Heuristics","volume":"Volume 9345","author":"Calimeri","year":"2015","journal-title":"Proceedings of the Thirteenth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR\u201915)"},{"key":"ref_20","unstructured":"Nebel, W., and Atienza, D. (2015, January 9\u201313). A symbolic system synthesis approach for hard real-time systems based on coordinated SMT-solving. Proceedings of the Eighteenth Conference on Design, Automation and Test in Europe (DATE\u201915), Grenoble, France."},{"key":"ref_21","unstructured":"Atienza, D., and Di Natale, G. (2017, January 27\u201331). Enhancing symbolic system synthesis through ASPmT with partial assignment evaluation. Proceedings of the Twentieth Conference on Design, Automation and Test in Europe (DATE\u201917), Lausanne, Switzerland."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1017\/S1471068420000046","article-title":"Train scheduling with hybrid ASP","volume":"21","author":"Abels","year":"2021","journal-title":"Theory Pract. Log. Program."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1017\/S1471068422000217","article-title":"Problem Decomposition and Multi-shot ASP Solving for Job-shop Scheduling","volume":"22","author":"Gebser","year":"2022","journal-title":"Theory Pract. Log. Program."},{"key":"ref_24","unstructured":"Biere, A., Heule, M., van Maaren, H., and Walsh, T. (2009). Handbook of Satisfiability, IOS Press. Frontiers in Artificial Intelligence and Applications."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/j.sysarc.2013.05.023","article-title":"Exploiting domain knowledge in system-level MPSoC design space exploration","volume":"59","author":"Thompson","year":"2013","journal-title":"J. Syst. Archit."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"911","DOI":"10.1109\/TCAD.2010.2048354","article-title":"Ant Colony Heuristic for Mapping and Scheduling Tasks and Communications on Heterogeneous Embedded Systems","volume":"29","author":"Ferrandi","year":"2010","journal-title":"IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Lukasiewycz, M., Gla\u00df, M., Haubelt, C., and Teich, J. (2008, January 21\u201324). Efficient symbolic multi-objective design space exploration. Proceedings of the 13th Asia and South Pacific Design Automation Conference (ASP-DAC\u201908), Seoul, Republic of Korea.","DOI":"10.1109\/ASPDAC.2008.4484040"},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Khalilzad, N., Rosvall, K., and Sander, I. (2016, January 14\u201316). A modular design space exploration framework for multiprocessor real-time systems. Proceedings of the Forum on Specification and Design Languages (FDL\u201916), Bremen, Germany.","DOI":"10.1109\/FDL.2016.7880377"},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Neubauer, K., Haubelt, C., and Gla\u00df, M. (2016, January 17\u201321). Supporting composition in symbolic system synthesis. Proceedings of the International Conference on Embedded Computer Systems: Architectures, Modeling and Simulation (SAMOS\u201916), Agios Konstantinos, Greece.","DOI":"10.1109\/SAMOS.2016.7818340"},{"key":"ref_30","unstructured":"Schlichter, T., Lukasiewycz, M., Haubelt, C., and Teich, J. (2006, January 2\u20133). Improving system level design space exploration by incorporating SAT-solvers into multi-objective evolutionary algorithms. Proceedings of the IEEE Computer Society Annual Symposium on Emerging VLSI Technologies and Architectures (ISVLSI\u201906), Karlsruhe, Germany."},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Apt, K., Fages, F., Rossi, F., Szeredi, P., and V\u00e1ncza, J. (2004). Recent Advances in Constraints, Springer.","DOI":"10.1007\/b96986"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10479-018-2757-7","article-title":"teaspoon: Solving the Curriculum-Based Course Timetabling Problems with Answer Set Programming","volume":"275","author":"Banbara","year":"2019","journal-title":"Ann. Oper. Res."},{"key":"ref_33","first-page":"109","article-title":"Nurse (re) scheduling via answer set programming","volume":"12","author":"Alviano","year":"2018","journal-title":"Intell. Artif."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/16\/4\/179\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T19:02:37Z","timestamp":1760122957000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/16\/4\/179"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,24]]},"references-count":33,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2023,4]]}},"alternative-id":["a16040179"],"URL":"https:\/\/doi.org\/10.3390\/a16040179","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2023,3,24]]}}}