{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T16:05:40Z","timestamp":1772121940930,"version":"3.50.1"},"reference-count":11,"publisher":"Walter de Gruyter GmbH","issue":"4-5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,8,26]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p xml:lang=\"en\">Explaining and understanding AI-generated policies of control problems is crucial for the acceptance of such policies. Based on an optimisation challenge that took place at GECCO 2024, we describe different solutions for optimising generated policies for the well-known game 2048. At the same time, these generated policies aim to be simpler to understand and, thus, their decisions explainable in contrast to current solutions for 2048, as, e.g., neural network-based models. Our approach uses only Boolean expressions in the policy, and the optimisation shows that such a policy has advantages compared to more complex policy variants. The optimisation generates better results in a shorter time than for non-Boolean expressions. Additionally, the Boolean policies are smaller in size and can be reduced even more when applying existing techniques for term rewriting and simplification. These simplifications, again, may aid in understanding the policy\u2019s decision.<\/jats:p>","DOI":"10.1515\/itit-2024-0072","type":"journal-article","created":{"date-parts":[[2025,2,8]],"date-time":"2025-02-08T03:10:39Z","timestamp":1738984239000},"page":"174-186","source":"Crossref","is-referenced-by-count":1,"title":["Why less is sometimes more"],"prefix":"10.1515","volume":"66","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6093-9229","authenticated-orcid":false,"given":"Bernhard J.","family":"Berger","sequence":"first","affiliation":[{"name":"Hamburg University of Technology , 21071 Hamburg , Germany"},{"name":"University of Rostock , Albert-Einstein-Stra\u00dfe 22, 18059 Rostock , Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0392-6397","authenticated-orcid":false,"given":"Christina","family":"Plump","sequence":"additional","affiliation":[{"name":"DFKI GmbH \u2013 Cyber-Physical Systems , Bibliotheksstra\u00dfe 5, 28359 Bremen , Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9872-1740","authenticated-orcid":false,"given":"Rolf","family":"Drechsler","sequence":"additional","affiliation":[{"name":"DFKI GmbH \u2013 Cyber-Physical Systems , Bibliotheksstra\u00dfe 5, 28359 Bremen , Germany"},{"name":"University of Bremen , Bibliothekstra\u00dfe 1, 28359 Bremen , Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"374","published-online":{"date-parts":[[2025,2,10]]},"reference":[{"key":"2025030616183066265_j_itit-2024-0072_ref_001","doi-asserted-by":"crossref","unstructured":"R. Drechsler, et al.., \u201cTowards self-explaining digital systems: a design methodology for the next generation,\u201d in 2018 IEEE 3rd International Verification and Security Workshop (IVSW), IEEE, 2018.","DOI":"10.1109\/IVSW.2018.8494895"},{"key":"2025030616183066265_j_itit-2024-0072_ref_002","doi-asserted-by":"crossref","unstructured":"M. Blumreiter, et al.., \u201cTowards self-explainable cyber-physical systems,\u201d in 2019 ACM\/IEEE 22nd International Conference on Model Driven Engineering Languages and Systems Companion (MODELS-C), IEEE, 2019.","DOI":"10.1109\/MODELS-C.2019.00084"},{"key":"2025030616183066265_j_itit-2024-0072_ref_003","doi-asserted-by":"crossref","unstructured":"S. Jesus, et al.., \u201cHow can I choose an explainer? An application-grounded evaluation of post-hoc explanations,\u201d in Proceedings of the 2021 ACM Conference on Fairness, Accountability, and Transparency. FAccT\u201921. ACM, 2021.","DOI":"10.1145\/3442188.3445941"},{"key":"2025030616183066265_j_itit-2024-0072_ref_004","doi-asserted-by":"crossref","unstructured":"S. Brdnik and B. \u0160umak, \u201cCurrent trends, challenges and techniques in XAI field; A tertiary study of XAI research,\u201d in 2024 47th MIPRO ICT and Electronics Convention (MIPRO), IEEE, 2024.","DOI":"10.1109\/MIPRO60963.2024.10569528"},{"key":"2025030616183066265_j_itit-2024-0072_ref_005","unstructured":"G. Nadizar, et al.., Interpretable Control Competition, Challenge Homepage, 2024. Available at: https:\/\/gecco-2024.sigevo.org\/Competitions&id_Interpretable%20Control%20Competition."},{"key":"2025030616183066265_j_itit-2024-0072_ref_006","unstructured":"N. Virdee, 2048 \u2013 Deep Reinforcment Learning, GitHub Repository, 2024. Available at: https:\/\/github.com\/navjindervirdee\/2048-deep-reinforcement-learning."},{"key":"2025030616183066265_j_itit-2024-0072_ref_007","unstructured":"S. Iommi, Deep Reinforcement Learning to Play 2048 (with Keras), GitHub Repository, 2024. Available at: https:\/\/github.com\/SergioIommi\/DQN-2048."},{"key":"2025030616183066265_j_itit-2024-0072_ref_008","unstructured":"A. Abdelkader, A. Acharya, and P. Dasler, \u201c2048 without new tiles is still hard,\u201d in Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, 2016."},{"key":"2025030616183066265_j_itit-2024-0072_ref_009","doi-asserted-by":"crossref","unstructured":"S. John, J. Kosiol, L. Lambers, and G. Taentzer, \u201cA graph-based framework for model-driven optimization facilitating impact analysis of mutation operator properties,\u201d Software Syst. Model., vol.\u00a022, no.\u00a04, pp.\u00a01281\u20131318, 2023. https:\/\/doi.org\/10.1007\/s10270-022-01078-x.","DOI":"10.1007\/s10270-022-01078-x"},{"key":"2025030616183066265_j_itit-2024-0072_ref_010","doi-asserted-by":"crossref","unstructured":"B. J. Berger, C. Plump, and R. Drechsler, \u201cEvoAl: a domain-specific language-based approach to optimisation,\u201d in 2023 IEEE Congress on Evolutionary Computation (CEC), 2023, pp.\u00a01\u201310.","DOI":"10.1109\/CEC53210.2023.10253985"},{"key":"2025030616183066265_j_itit-2024-0072_ref_011","doi-asserted-by":"crossref","unstructured":"G. Fey, M. Fr\u00e4nzle, and R. Drechsler, \u201cSelf-explanation in systems of systems,\u201d in 2022 IEEE 30th International Requirements Engineering Conference Workshops (REW), 2022, pp.\u00a085\u201391.","DOI":"10.1109\/REW56159.2022.00023"}],"container-title":["it - Information Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/itit-2024-0072\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/itit-2024-0072\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,6]],"date-time":"2025-03-06T16:19:07Z","timestamp":1741277947000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/itit-2024-0072\/html"}},"subtitle":["Using Boolean literals to solve 2048"],"short-title":[],"issued":{"date-parts":[[2024,8,1]]},"references-count":11,"journal-issue":{"issue":"4-5","published-online":{"date-parts":[[2025,3,3]]},"published-print":{"date-parts":[[2024,8,26]]}},"alternative-id":["10.1515\/itit-2024-0072"],"URL":"https:\/\/doi.org\/10.1515\/itit-2024-0072","relation":{},"ISSN":["1611-2776","2196-7032"],"issn-type":[{"value":"1611-2776","type":"print"},{"value":"2196-7032","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,8,1]]}}}