[{"publication":"Social explainable AI","type":"book_chapter","editor":[{"first_name":"Katharina J.","full_name":"Rohlfing, Katharina J.","last_name":"Rohlfing"},{"first_name":"Kary","last_name":"Främling","full_name":"Främling, Kary"},{"last_name":"Lim","full_name":"Lim, Brian","first_name":"Brian"},{"first_name":"Suzana","last_name":"Alpsancar","full_name":"Alpsancar, Suzana"},{"first_name":"Kisten","last_name":"Thommes","full_name":"Thommes, Kisten"}],"status":"public","_id":"65084","project":[{"_id":"111","name":"TRR 318; TP A01: Adaptives Erklären"},{"name":"TRR 318; TP A04: Integration des technischen Modells in das Partnermodell bei der Erklärung von digitalen Artefakten","_id":"114"},{"name":"TRR 318; TP B01: Ein dialogbasierter Ansatz zur Erklärung von Modellen des maschinellen Lernens","_id":"121"}],"department":[{"_id":"427"},{"_id":"660"}],"user_id":"90826","language":[{"iso":"eng"}],"related_material":{"link":[{"url":"https://link.springer.com/chapter/10.1007/978-981-96-5290-7_14","relation":"confirmation"}]},"year":"2026","page":"269-295","citation":{"ama":"Buhl HM, Vollmer A-L, Alami R, Booshehri M, Främling K. Models of the situation, the explanandum, and the interaction partner. In: Rohlfing KJ, Främling K, Lim B, Alpsancar S, Thommes K, eds. <i>Social Explainable AI</i>. Springer; 2026:269-295. doi:<a href=\"https://doi.org/10.1007/978-981-96-5290-7_14\">https://doi.org/10.1007/978-981-96-5290-7_14</a>","ieee":"H. M. Buhl, A.-L. Vollmer, R. Alami, M. Booshehri, and K. Främling, “Models of the situation, the explanandum, and the interaction partner,” in <i>Social explainable AI</i>, K. J. Rohlfing, K. Främling, B. Lim, S. Alpsancar, and K. Thommes, Eds. Springer, 2026, pp. 269–295.","chicago":"Buhl, Heike M., Anna-Lisa Vollmer, Rachid Alami, Meisam Booshehri, and Kary Främling. “Models of the Situation, the Explanandum, and the Interaction Partner.” In <i>Social Explainable AI</i>, edited by Katharina J. Rohlfing, Kary Främling, Brian Lim, Suzana Alpsancar, and Kisten Thommes, 269–95. Springer, 2026. <a href=\"https://doi.org/10.1007/978-981-96-5290-7_14\">https://doi.org/10.1007/978-981-96-5290-7_14</a>.","apa":"Buhl, H. M., Vollmer, A.-L., Alami, R., Booshehri, M., &#38; Främling, K. (2026). Models of the situation, the explanandum, and the interaction partner. In K. J. Rohlfing, K. Främling, B. Lim, S. Alpsancar, &#38; K. Thommes (Eds.), <i>Social explainable AI</i> (pp. 269–295). Springer. <a href=\"https://doi.org/10.1007/978-981-96-5290-7_14\">https://doi.org/10.1007/978-981-96-5290-7_14</a>","bibtex":"@inbook{Buhl_Vollmer_Alami_Booshehri_Främling_2026, title={Models of the situation, the explanandum, and the interaction partner}, DOI={<a href=\"https://doi.org/10.1007/978-981-96-5290-7_14\">https://doi.org/10.1007/978-981-96-5290-7_14</a>}, booktitle={Social explainable AI}, publisher={Springer}, author={Buhl, Heike M. and Vollmer, Anna-Lisa and Alami, Rachid and Booshehri, Meisam and Främling, Kary}, editor={Rohlfing, Katharina J. and Främling, Kary and Lim, Brian and Alpsancar, Suzana and Thommes, Kisten}, year={2026}, pages={269–295} }","mla":"Buhl, Heike M., et al. “Models of the Situation, the Explanandum, and the Interaction Partner.” <i>Social Explainable AI</i>, edited by Katharina J. Rohlfing et al., Springer, 2026, pp. 269–95, doi:<a href=\"https://doi.org/10.1007/978-981-96-5290-7_14\">https://doi.org/10.1007/978-981-96-5290-7_14</a>.","short":"H.M. Buhl, A.-L. Vollmer, R. Alami, M. Booshehri, K. Främling, in: K.J. Rohlfing, K. Främling, B. Lim, S. Alpsancar, K. Thommes (Eds.), Social Explainable AI, Springer, 2026, pp. 269–295."},"date_updated":"2026-03-23T18:24:49Z","oa":"1","publisher":"Springer","author":[{"last_name":"Buhl","full_name":"Buhl, Heike M.","id":"27152","first_name":"Heike M."},{"last_name":"Vollmer","full_name":"Vollmer, Anna-Lisa","id":"86589","first_name":"Anna-Lisa"},{"full_name":"Alami, Rachid","last_name":"Alami","first_name":"Rachid"},{"id":"93424","full_name":"Booshehri, Meisam","last_name":"Booshehri","first_name":"Meisam"},{"first_name":"Kary","last_name":"Främling","full_name":"Främling, Kary"}],"date_created":"2026-03-23T08:06:57Z","title":"Models of the situation, the explanandum, and the interaction partner","doi":"https://doi.org/10.1007/978-981-96-5290-7_14","main_file_link":[{"open_access":"1","url":"https://link.springer.com/chapter/10.1007/978-981-96-5290-7_14"}]},{"type":"preprint","publication":"arXiv:2507.21955","status":"public","abstract":[{"lang":"eng","text":"Abduction is the task of computing a sufficient extension of a knowledge base (KB) that entails a conclusion not entailed by the original KB. It serves to compute explanations, or hypotheses, for such missing entailments. While this task has been intensively investigated for perfect data and under classical semantics, less is known about abduction when erroneous data results in inconsistent KBs. In this paper we define a suitable notion of abduction under repair semantics and propose a set of minimality criteria that guides abduction towards `useful' hypotheses. We provide initial complexity results on deciding existence of and verifying abductive solutions with these criteria, under different repair semantics and for the description logics DL-Lite and EL_bot."}],"user_id":"109969","department":[{"_id":"574"},{"_id":"888"}],"project":[{"name":"TRR 318; TP B01: Ein dialogbasierter Ansatz zur Erklärung von Modellen des maschinellen Lernens","_id":"121"}],"_id":"61065","external_id":{"arxiv":["2507.21955"]},"language":[{"iso":"eng"}],"citation":{"ama":"Haak A, Koopmann P, Mahmood Y, Turhan A-Y. Why not? Developing ABox Abduction beyond Repairs. <i>arXiv:250721955</i>. Published online 2025.","chicago":"Haak, Anselm, Patrick Koopmann, Yasir Mahmood, and Anni-Yasmin Turhan. “Why Not? Developing ABox Abduction beyond Repairs.” <i>ArXiv:2507.21955</i>, 2025.","ieee":"A. Haak, P. Koopmann, Y. Mahmood, and A.-Y. Turhan, “Why not? Developing ABox Abduction beyond Repairs,” <i>arXiv:2507.21955</i>. 2025.","apa":"Haak, A., Koopmann, P., Mahmood, Y., &#38; Turhan, A.-Y. (2025). Why not? Developing ABox Abduction beyond Repairs. In <i>arXiv:2507.21955</i>.","mla":"Haak, Anselm, et al. “Why Not? Developing ABox Abduction beyond Repairs.” <i>ArXiv:2507.21955</i>, 2025.","short":"A. Haak, P. Koopmann, Y. Mahmood, A.-Y. Turhan, ArXiv:2507.21955 (2025).","bibtex":"@article{Haak_Koopmann_Mahmood_Turhan_2025, title={Why not? Developing ABox Abduction beyond Repairs}, journal={arXiv:2507.21955}, author={Haak, Anselm and Koopmann, Patrick and Mahmood, Yasir and Turhan, Anni-Yasmin}, year={2025} }"},"year":"2025","author":[{"first_name":"Anselm","last_name":"Haak","id":"109969","full_name":"Haak, Anselm"},{"full_name":"Koopmann, Patrick","last_name":"Koopmann","first_name":"Patrick"},{"full_name":"Mahmood, Yasir","id":"99353","last_name":"Mahmood","first_name":"Yasir"},{"first_name":"Anni-Yasmin","full_name":"Turhan, Anni-Yasmin","id":"104470","last_name":"Turhan"}],"date_created":"2025-08-29T07:58:08Z","date_updated":"2026-02-05T13:55:48Z","title":"Why not? Developing ABox Abduction beyond Repairs"},{"publication":"Proceedings of the AAAI Conference on Artificial Intelligence","abstract":[{"lang":"eng","text":"<jats:p>The connection between inconsistent databases and Dung’s abstract argumentation framework has recently drawn growing interest. Specifically, an inconsistent database, involving certain types of integrity constraints such as functional and inclusion dependencies, can be viewed as an argumentation framework in Dung’s setting. Nevertheless, no prior work has explored the exact expressive power of Dung’s theory of argumentation when compared to inconsistent databases and integrity constraints. In this paper, we close this gap by arguing that an argumentation framework can also be viewed as an inconsistent database. We first establish a connection between subset-repairs for databases and extensions for AFs considering conflict-free, naive, admissible, and preferred semantics. Further, we define a new family of attribute-based repairs based on the principle of maximal content preservation. The effectiveness of these repairs is then highlighted by connecting them to stable, semi-stable, and stage semantics. Our main contributions include translating an argumentation framework into a database together with integrity constraints. Moreover, this translation can be achieved in polynomial time, which is essential in transferring complexity results between the two formalisms.</jats:p>"}],"language":[{"iso":"eng"}],"issue":"14","year":"2025","date_created":"2025-05-15T11:05:36Z","publisher":"Association for the Advancement of Artificial Intelligence (AAAI)","title":"Dung’s Argumentation Framework: Unveiling the Expressive Power with Inconsistent Databases","type":"conference","status":"public","department":[{"_id":"574"}],"user_id":"99353","_id":"59910","project":[{"name":"TRR 318; TP B01: Ein dialogbasierter Ansatz zur Erklärung von Modellen des maschinellen Lernens","_id":"121"}],"publication_identifier":{"issn":["2374-3468","2159-5399"]},"publication_status":"published","page":"15058-15066","intvolume":"        39","citation":{"apa":"Mahmood, Y., Hecher, M., &#38; Ngonga Ngomo, A.-C. (2025). Dung’s Argumentation Framework: Unveiling the Expressive Power with Inconsistent Databases. <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, <i>39</i>(14), 15058–15066. <a href=\"https://doi.org/10.1609/aaai.v39i14.33651\">https://doi.org/10.1609/aaai.v39i14.33651</a>","bibtex":"@inproceedings{Mahmood_Hecher_Ngonga Ngomo_2025, title={Dung’s Argumentation Framework: Unveiling the Expressive Power with Inconsistent Databases}, volume={39}, DOI={<a href=\"https://doi.org/10.1609/aaai.v39i14.33651\">10.1609/aaai.v39i14.33651</a>}, number={14}, booktitle={Proceedings of the AAAI Conference on Artificial Intelligence}, publisher={Association for the Advancement of Artificial Intelligence (AAAI)}, author={Mahmood, Yasir and Hecher, Markus and Ngonga Ngomo, Axel-Cyrille}, year={2025}, pages={15058–15066} }","mla":"Mahmood, Yasir, et al. “Dung’s Argumentation Framework: Unveiling the Expressive Power with Inconsistent Databases.” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, vol. 39, no. 14, Association for the Advancement of Artificial Intelligence (AAAI), 2025, pp. 15058–66, doi:<a href=\"https://doi.org/10.1609/aaai.v39i14.33651\">10.1609/aaai.v39i14.33651</a>.","short":"Y. Mahmood, M. Hecher, A.-C. Ngonga Ngomo, in: Proceedings of the AAAI Conference on Artificial Intelligence, Association for the Advancement of Artificial Intelligence (AAAI), 2025, pp. 15058–15066.","chicago":"Mahmood, Yasir, Markus Hecher, and Axel-Cyrille Ngonga Ngomo. “Dung’s Argumentation Framework: Unveiling the Expressive Power with Inconsistent Databases.” In <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, 39:15058–66. Association for the Advancement of Artificial Intelligence (AAAI), 2025. <a href=\"https://doi.org/10.1609/aaai.v39i14.33651\">https://doi.org/10.1609/aaai.v39i14.33651</a>.","ieee":"Y. Mahmood, M. Hecher, and A.-C. Ngonga Ngomo, “Dung’s Argumentation Framework: Unveiling the Expressive Power with Inconsistent Databases,” in <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, 2025, vol. 39, no. 14, pp. 15058–15066, doi: <a href=\"https://doi.org/10.1609/aaai.v39i14.33651\">10.1609/aaai.v39i14.33651</a>.","ama":"Mahmood Y, Hecher M, Ngonga Ngomo A-C. Dung’s Argumentation Framework: Unveiling the Expressive Power with Inconsistent Databases. In: <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. Vol 39. Association for the Advancement of Artificial Intelligence (AAAI); 2025:15058-15066. doi:<a href=\"https://doi.org/10.1609/aaai.v39i14.33651\">10.1609/aaai.v39i14.33651</a>"},"volume":39,"author":[{"first_name":"Yasir","last_name":"Mahmood","full_name":"Mahmood, Yasir","id":"99353"},{"first_name":"Markus","last_name":"Hecher","full_name":"Hecher, Markus"},{"full_name":"Ngonga Ngomo, Axel-Cyrille","id":"65716","last_name":"Ngonga Ngomo","first_name":"Axel-Cyrille"}],"date_updated":"2026-02-20T10:07:00Z","doi":"10.1609/aaai.v39i14.33651"},{"language":[{"iso":"eng"}],"project":[{"grant_number":"438445824","name":"TRR 318 - B01: TRR 318 - Ein dialogbasierter Ansatz zur Erklärung von Modellen des maschinellen Lernens (Teilprojekt B01)","_id":"121"},{"_id":"127","name":"TRR 318 - C4: TRR 318 - Subproject C4 - Metaphern als Werkzeug des Erklärens"},{"name":"TRR 318 - B3: TRR 318 - Subproject B3","_id":"122"},{"_id":"119","name":"TRR 318 - Ö: TRR 318 - Project Area Ö"},{"grant_number":"438445824","_id":"114","name":"TRR 318 - A04: TRR 318 - Integration des technischen Modells in das Partnermodell bei der Erklärung von digitalen Artefakten (Teilprojekt A04)"}],"external_id":{"arxiv":["2504.18483"]},"_id":"60718","user_id":"98454","abstract":[{"lang":"eng","text":"The ability to generate explanations that are understood by explainees is the\r\nquintessence of explainable artificial intelligence. Since understanding\r\ndepends on the explainee's background and needs, recent research focused on\r\nco-constructive explanation dialogues, where an explainer continuously monitors\r\nthe explainee's understanding and adapts their explanations dynamically. We\r\ninvestigate the ability of large language models (LLMs) to engage as explainers\r\nin co-constructive explanation dialogues. In particular, we present a user\r\nstudy in which explainees interact with an LLM in two settings, one of which\r\ninvolves the LLM being instructed to explain a topic co-constructively. We\r\nevaluate the explainees' understanding before and after the dialogue, as well\r\nas their perception of the LLMs' co-constructive behavior. Our results suggest\r\nthat LLMs show some co-constructive behaviors, such as asking verification\r\nquestions, that foster the explainees' engagement and can improve understanding\r\nof a topic. However, their ability to effectively monitor the current\r\nunderstanding and scaffold the explanations accordingly remains limited."}],"status":"public","type":"preprint","publication":"arXiv:2504.18483","title":"Investigating Co-Constructive Behavior of Large Language Models in  Explanation Dialogues","main_file_link":[{"url":"https://arxiv.org/pdf/2504.18483"}],"date_updated":"2025-07-23T11:23:32Z","author":[{"last_name":"Fichtel","full_name":"Fichtel, Leandra","first_name":"Leandra"},{"full_name":"Spliethöver, Maximilian","last_name":"Spliethöver","first_name":"Maximilian"},{"last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke","first_name":"Eyke"},{"last_name":"Jimenez","full_name":"Jimenez, Patricia","id":"103339","first_name":"Patricia"},{"first_name":"Nils","full_name":"Klowait, Nils","id":"98454","orcid":"0000-0002-7347-099X","last_name":"Klowait"},{"first_name":"Stefan","last_name":"Kopp","full_name":"Kopp, Stefan"},{"full_name":"Ngonga Ngomo, Axel-Cyrille","id":"65716","last_name":"Ngonga Ngomo","first_name":"Axel-Cyrille"},{"full_name":"Robrecht, Amelie","last_name":"Robrecht","first_name":"Amelie"},{"first_name":"Ingrid","last_name":"Scharlau","orcid":"0000-0003-2364-9489","full_name":"Scharlau, Ingrid","id":"451"},{"first_name":"Lutz","last_name":"Terfloth","id":"37320","full_name":"Terfloth, Lutz"},{"first_name":"Anna-Lisa","last_name":"Vollmer","full_name":"Vollmer, Anna-Lisa"},{"full_name":"Wachsmuth, Henning","last_name":"Wachsmuth","first_name":"Henning"}],"date_created":"2025-07-22T13:10:42Z","year":"2025","citation":{"ieee":"L. Fichtel <i>et al.</i>, “Investigating Co-Constructive Behavior of Large Language Models in  Explanation Dialogues,” <i>arXiv:2504.18483</i>. 2025.","chicago":"Fichtel, Leandra, Maximilian Spliethöver, Eyke Hüllermeier, Patricia Jimenez, Nils Klowait, Stefan Kopp, Axel-Cyrille Ngonga Ngomo, et al. “Investigating Co-Constructive Behavior of Large Language Models in  Explanation Dialogues.” <i>ArXiv:2504.18483</i>, 2025.","ama":"Fichtel L, Spliethöver M, Hüllermeier E, et al. Investigating Co-Constructive Behavior of Large Language Models in  Explanation Dialogues. <i>arXiv:250418483</i>. Published online 2025.","apa":"Fichtel, L., Spliethöver, M., Hüllermeier, E., Jimenez, P., Klowait, N., Kopp, S., Ngonga Ngomo, A.-C., Robrecht, A., Scharlau, I., Terfloth, L., Vollmer, A.-L., &#38; Wachsmuth, H. (2025). Investigating Co-Constructive Behavior of Large Language Models in  Explanation Dialogues. In <i>arXiv:2504.18483</i>.","short":"L. Fichtel, M. Spliethöver, E. Hüllermeier, P. Jimenez, N. Klowait, S. Kopp, A.-C. Ngonga Ngomo, A. Robrecht, I. Scharlau, L. Terfloth, A.-L. Vollmer, H. Wachsmuth, ArXiv:2504.18483 (2025).","mla":"Fichtel, Leandra, et al. “Investigating Co-Constructive Behavior of Large Language Models in  Explanation Dialogues.” <i>ArXiv:2504.18483</i>, 2025.","bibtex":"@article{Fichtel_Spliethöver_Hüllermeier_Jimenez_Klowait_Kopp_Ngonga Ngomo_Robrecht_Scharlau_Terfloth_et al._2025, title={Investigating Co-Constructive Behavior of Large Language Models in  Explanation Dialogues}, journal={arXiv:2504.18483}, author={Fichtel, Leandra and Spliethöver, Maximilian and Hüllermeier, Eyke and Jimenez, Patricia and Klowait, Nils and Kopp, Stefan and Ngonga Ngomo, Axel-Cyrille and Robrecht, Amelie and Scharlau, Ingrid and Terfloth, Lutz and et al.}, year={2025} }"},"page":"20","has_accepted_license":"1"},{"title":"Logics with probabilistic team semantics and the Boolean negation","doi":"10.1093/logcom/exaf021","publisher":"Oxford University Press (OUP)","date_updated":"2025-09-11T10:00:26Z","volume":35,"date_created":"2025-05-15T11:07:28Z","author":[{"last_name":"Hannula","full_name":"Hannula, Miika","first_name":"Miika"},{"first_name":"Minna","last_name":"Hirvonen","full_name":"Hirvonen, Minna"},{"full_name":"Kontinen, Juha","last_name":"Kontinen","first_name":"Juha"},{"first_name":"Yasir","full_name":"Mahmood, Yasir","id":"99353","last_name":"Mahmood"},{"full_name":"Meier, Arne","last_name":"Meier","first_name":"Arne"},{"last_name":"Virtema","full_name":"Virtema, Jonni","first_name":"Jonni"}],"year":"2025","intvolume":"        35","citation":{"apa":"Hannula, M., Hirvonen, M., Kontinen, J., Mahmood, Y., Meier, A., &#38; Virtema, J. (2025). Logics with probabilistic team semantics and the Boolean negation. <i>Journal of Logic and Computation</i>, <i>35</i>(3). <a href=\"https://doi.org/10.1093/logcom/exaf021\">https://doi.org/10.1093/logcom/exaf021</a>","bibtex":"@article{Hannula_Hirvonen_Kontinen_Mahmood_Meier_Virtema_2025, title={Logics with probabilistic team semantics and the Boolean negation}, volume={35}, DOI={<a href=\"https://doi.org/10.1093/logcom/exaf021\">10.1093/logcom/exaf021</a>}, number={3}, journal={Journal of Logic and Computation}, publisher={Oxford University Press (OUP)}, author={Hannula, Miika and Hirvonen, Minna and Kontinen, Juha and Mahmood, Yasir and Meier, Arne and Virtema, Jonni}, year={2025} }","short":"M. Hannula, M. Hirvonen, J. Kontinen, Y. Mahmood, A. Meier, J. Virtema, Journal of Logic and Computation 35 (2025).","mla":"Hannula, Miika, et al. “Logics with Probabilistic Team Semantics and the Boolean Negation.” <i>Journal of Logic and Computation</i>, vol. 35, no. 3, Oxford University Press (OUP), 2025, doi:<a href=\"https://doi.org/10.1093/logcom/exaf021\">10.1093/logcom/exaf021</a>.","ama":"Hannula M, Hirvonen M, Kontinen J, Mahmood Y, Meier A, Virtema J. Logics with probabilistic team semantics and the Boolean negation. <i>Journal of Logic and Computation</i>. 2025;35(3). doi:<a href=\"https://doi.org/10.1093/logcom/exaf021\">10.1093/logcom/exaf021</a>","chicago":"Hannula, Miika, Minna Hirvonen, Juha Kontinen, Yasir Mahmood, Arne Meier, and Jonni Virtema. “Logics with Probabilistic Team Semantics and the Boolean Negation.” <i>Journal of Logic and Computation</i> 35, no. 3 (2025). <a href=\"https://doi.org/10.1093/logcom/exaf021\">https://doi.org/10.1093/logcom/exaf021</a>.","ieee":"M. Hannula, M. Hirvonen, J. Kontinen, Y. Mahmood, A. Meier, and J. Virtema, “Logics with probabilistic team semantics and the Boolean negation,” <i>Journal of Logic and Computation</i>, vol. 35, no. 3, 2025, doi: <a href=\"https://doi.org/10.1093/logcom/exaf021\">10.1093/logcom/exaf021</a>."},"publication_identifier":{"issn":["0955-792X","1465-363X"]},"publication_status":"published","issue":"3","language":[{"iso":"eng"}],"_id":"59912","project":[{"name":"TRR 318; TP B01: Ein dialogbasierter Ansatz zur Erklärung von Modellen des maschinellen Lernens","_id":"121"}],"department":[{"_id":"574"}],"user_id":"99353","abstract":[{"lang":"eng","text":"<jats:title>Abstract</jats:title>\r\n               <jats:p>We study the expressivity and the complexity of various logics in probabilistic team semantics with the Boolean negation. In particular, we study the extension of probabilistic independence logic with the Boolean negation, and a recently introduced logic first-order theory of random variables with probabilistic independence. We give several results that compare the expressivity of these logics with the most studied logics in probabilistic team semantics setting, as well as relating their expressivity to a numerical variant of second-order logic. In addition, we introduce novel entropy atoms and show that the extension of first-order logic by entropy atoms subsumes probabilistic independence logic. Finally, we obtain some results on the complexity of model checking, validity and satisfiability of our logics.</jats:p>"}],"status":"public","publication":"Journal of Logic and Computation","type":"journal_article"},{"user_id":"99353","department":[{"_id":"574"}],"project":[{"name":"TRR 318; TP B01: Ein dialogbasierter Ansatz zur Erklärung von Modellen des maschinellen Lernens","_id":"121"}],"external_id":{"arxiv":["2505.10982"]},"_id":"61066","language":[{"iso":"eng"}],"type":"preprint","publication":"arXiv:2505.10982","status":"public","abstract":[{"text":"Argumentation is a central subarea of Artificial Intelligence (AI) for\r\nmodeling and reasoning about arguments. The semantics of abstract argumentation\r\nframeworks (AFs) is given by sets of arguments (extensions) and conditions on\r\nthe relationship between them, such as stable or admissible. Today's solvers\r\nimplement tasks such as finding extensions, deciding credulous or skeptical\r\nacceptance, counting, or enumerating extensions. While these tasks are well\r\ncharted, the area between decision, counting/enumeration and fine-grained\r\nreasoning requires expensive reasoning so far. We introduce a novel concept\r\n(facets) for reasoning between decision and enumeration. Facets are arguments\r\nthat belong to some extensions (credulous) but not to all extensions\r\n(skeptical). They are most natural when a user aims to navigate, filter, or\r\ncomprehend the significance of specific arguments, according to their needs. We\r\nstudy the complexity and show that tasks involving facets are much easier than\r\ncounting extensions. Finally, we provide an implementation, and conduct\r\nexperiments to demonstrate feasibility.","lang":"eng"}],"date_created":"2025-08-29T08:07:43Z","author":[{"first_name":"Johannes","last_name":"Fichte","full_name":"Fichte, Johannes"},{"full_name":"Fröhlich, Nicolas","last_name":"Fröhlich","first_name":"Nicolas"},{"full_name":"Hecher, Markus","last_name":"Hecher","first_name":"Markus"},{"first_name":"Victor","last_name":"Lagerkvist","full_name":"Lagerkvist, Victor"},{"id":"99353","full_name":"Mahmood, Yasir","last_name":"Mahmood","first_name":"Yasir"},{"first_name":"Arne","full_name":"Meier, Arne","last_name":"Meier"},{"full_name":"Persson, Jonathan","last_name":"Persson","first_name":"Jonathan"}],"date_updated":"2025-09-11T09:58:34Z","title":"Facets in Argumentation: A Formal Approach to Argument Significance","citation":{"ieee":"J. Fichte <i>et al.</i>, “Facets in Argumentation: A Formal Approach to Argument Significance,” <i>arXiv:2505.10982</i>. 2025.","chicago":"Fichte, Johannes, Nicolas Fröhlich, Markus Hecher, Victor Lagerkvist, Yasir Mahmood, Arne Meier, and Jonathan Persson. “Facets in Argumentation: A Formal Approach to Argument Significance.” <i>ArXiv:2505.10982</i>, 2025.","ama":"Fichte J, Fröhlich N, Hecher M, et al. Facets in Argumentation: A Formal Approach to Argument Significance. <i>arXiv:250510982</i>. Published online 2025.","mla":"Fichte, Johannes, et al. “Facets in Argumentation: A Formal Approach to Argument Significance.” <i>ArXiv:2505.10982</i>, 2025.","short":"J. Fichte, N. Fröhlich, M. Hecher, V. Lagerkvist, Y. Mahmood, A. Meier, J. Persson, ArXiv:2505.10982 (2025).","bibtex":"@article{Fichte_Fröhlich_Hecher_Lagerkvist_Mahmood_Meier_Persson_2025, title={Facets in Argumentation: A Formal Approach to Argument Significance}, journal={arXiv:2505.10982}, author={Fichte, Johannes and Fröhlich, Nicolas and Hecher, Markus and Lagerkvist, Victor and Mahmood, Yasir and Meier, Arne and Persson, Jonathan}, year={2025} }","apa":"Fichte, J., Fröhlich, N., Hecher, M., Lagerkvist, V., Mahmood, Y., Meier, A., &#38; Persson, J. (2025). Facets in Argumentation: A Formal Approach to Argument Significance. In <i>arXiv:2505.10982</i>."},"year":"2025"},{"external_id":{"arxiv":["2504.18483"]},"language":[{"iso":"eng"}],"publication":"Proceedings of the 26th Annual Meeting of the Special Interest Group on Discourse and Dialogue","abstract":[{"lang":"eng","text":"The ability to generate explanations that are understood by explainees is the\r\nquintessence of explainable artificial intelligence. Since understanding\r\ndepends on the explainee's background and needs, recent research focused on\r\nco-constructive explanation dialogues, where an explainer continuously monitors\r\nthe explainee's understanding and adapts their explanations dynamically. We\r\ninvestigate the ability of large language models (LLMs) to engage as explainers\r\nin co-constructive explanation dialogues. In particular, we present a user\r\nstudy in which explainees interact with an LLM in two settings, one of which\r\ninvolves the LLM being instructed to explain a topic co-constructively. We\r\nevaluate the explainees' understanding before and after the dialogue, as well\r\nas their perception of the LLMs' co-constructive behavior. Our results suggest\r\nthat LLMs show some co-constructive behaviors, such as asking verification\r\nquestions, that foster the explainees' engagement and can improve understanding\r\nof a topic. However, their ability to effectively monitor the current\r\nunderstanding and scaffold the explanations accordingly remains limited."}],"publisher":"Association for Computational Linguistics","date_created":"2025-09-11T16:11:17Z","title":"Investigating Co-Constructive Behavior of Large Language Models in  Explanation Dialogues","year":"2025","project":[{"name":"TRR 318: Project Area INF","_id":"118"},{"name":"TRR 318; TP B01: Ein dialogbasierter Ansatz zur Erklärung von Modellen des maschinellen Lernens","_id":"121"},{"name":"TRR 318; TP C04: Metaphern als Werkzeug des Erklärens","_id":"127"},{"name":"TRR 318 - Subproject B3","_id":"122"},{"name":"TRR 318 - Project Area Ö","_id":"119"},{"name":"TRR 318; TP A04: Integration des technischen Modells in das Partnermodell bei der Erklärung von digitalen Artefakten","_id":"114"}],"_id":"61234","user_id":"84035","department":[{"_id":"660"}],"type":"conference","status":"public","oa":"1","date_updated":"2025-09-12T09:50:48Z","author":[{"full_name":"Fichtel, Leandra","last_name":"Fichtel","first_name":"Leandra"},{"last_name":"Spliethöver","orcid":"0000-0003-4364-1409","full_name":"Spliethöver, Maximilian","id":"84035","first_name":"Maximilian"},{"first_name":"Eyke","last_name":"Hüllermeier","full_name":"Hüllermeier, Eyke","id":"48129"},{"id":"103339","full_name":"Jimenez, Patricia","last_name":"Jimenez","first_name":"Patricia"},{"first_name":"Nils","full_name":"Klowait, Nils","id":"98454","orcid":"0000-0002-7347-099X","last_name":"Klowait"},{"first_name":"Stefan","full_name":"Kopp, Stefan","last_name":"Kopp"},{"first_name":"Axel-Cyrille","id":"65716","full_name":"Ngonga Ngomo, Axel-Cyrille","last_name":"Ngonga Ngomo"},{"id":"91982","full_name":"Robrecht, Amelie","last_name":"Robrecht","orcid":"0000-0001-5622-8248","first_name":"Amelie"},{"orcid":"0000-0003-2364-9489","last_name":"Scharlau","full_name":"Scharlau, Ingrid","id":"451","first_name":"Ingrid"},{"first_name":"Lutz","full_name":"Terfloth, Lutz","id":"37320","last_name":"Terfloth"},{"first_name":"Anna-Lisa","last_name":"Vollmer","full_name":"Vollmer, Anna-Lisa","id":"86589"},{"last_name":"Wachsmuth","id":"3900","full_name":"Wachsmuth, Henning","first_name":"Henning"}],"main_file_link":[{"url":"https://arxiv.org/abs/2504.18483","open_access":"1"}],"conference":{"name":"Annual Meeting of the Special Interest Group on Discourse and Dialogue"},"publication_status":"accepted","related_material":{"link":[{"url":"https://github.com/webis-de/sigdial25-co-constructive-llms","relation":"software"},{"url":"https://github.com/webis-de/sigdial25-co-constructive-llms-data","relation":"research_data"}]},"place":"Avignon, France","citation":{"apa":"Fichtel, L., Spliethöver, M., Hüllermeier, E., Jimenez, P., Klowait, N., Kopp, S., Ngonga Ngomo, A.-C., Robrecht, A., Scharlau, I., Terfloth, L., Vollmer, A.-L., &#38; Wachsmuth, H. (n.d.). Investigating Co-Constructive Behavior of Large Language Models in  Explanation Dialogues. <i>Proceedings of the 26th Annual Meeting of the Special Interest Group on Discourse and Dialogue</i>. Annual Meeting of the Special Interest Group on Discourse and Dialogue.","short":"L. Fichtel, M. Spliethöver, E. Hüllermeier, P. Jimenez, N. Klowait, S. Kopp, A.-C. Ngonga Ngomo, A. Robrecht, I. Scharlau, L. Terfloth, A.-L. Vollmer, H. Wachsmuth, in: Proceedings of the 26th Annual Meeting of the Special Interest Group on Discourse and Dialogue, Association for Computational Linguistics, Avignon, France, n.d.","bibtex":"@inproceedings{Fichtel_Spliethöver_Hüllermeier_Jimenez_Klowait_Kopp_Ngonga Ngomo_Robrecht_Scharlau_Terfloth_et al., place={Avignon, France}, title={Investigating Co-Constructive Behavior of Large Language Models in  Explanation Dialogues}, booktitle={Proceedings of the 26th Annual Meeting of the Special Interest Group on Discourse and Dialogue}, publisher={Association for Computational Linguistics}, author={Fichtel, Leandra and Spliethöver, Maximilian and Hüllermeier, Eyke and Jimenez, Patricia and Klowait, Nils and Kopp, Stefan and Ngonga Ngomo, Axel-Cyrille and Robrecht, Amelie and Scharlau, Ingrid and Terfloth, Lutz and et al.} }","mla":"Fichtel, Leandra, et al. “Investigating Co-Constructive Behavior of Large Language Models in  Explanation Dialogues.” <i>Proceedings of the 26th Annual Meeting of the Special Interest Group on Discourse and Dialogue</i>, Association for Computational Linguistics.","ieee":"L. Fichtel <i>et al.</i>, “Investigating Co-Constructive Behavior of Large Language Models in  Explanation Dialogues,” presented at the Annual Meeting of the Special Interest Group on Discourse and Dialogue.","chicago":"Fichtel, Leandra, Maximilian Spliethöver, Eyke Hüllermeier, Patricia Jimenez, Nils Klowait, Stefan Kopp, Axel-Cyrille Ngonga Ngomo, et al. “Investigating Co-Constructive Behavior of Large Language Models in  Explanation Dialogues.” In <i>Proceedings of the 26th Annual Meeting of the Special Interest Group on Discourse and Dialogue</i>. Avignon, France: Association for Computational Linguistics, n.d.","ama":"Fichtel L, Spliethöver M, Hüllermeier E, et al. Investigating Co-Constructive Behavior of Large Language Models in  Explanation Dialogues. In: <i>Proceedings of the 26th Annual Meeting of the Special Interest Group on Discourse and Dialogue</i>. Association for Computational Linguistics."}},{"citation":{"apa":"Mahmood, Y., Hecher, M., &#38; Ngonga Ngomo, A.-C. (2024). <i>Dung’s Argumentation Framework: Unveiling the Expressive Power with  Inconsistent Databases</i>. <a href=\"https://doi.org/10.1609/AAAI.V39I14.33651\">https://doi.org/10.1609/AAAI.V39I14.33651</a>","mla":"Mahmood, Yasir, et al. <i>Dung’s Argumentation Framework: Unveiling the Expressive Power with  Inconsistent Databases</i>. 2024, doi:<a href=\"https://doi.org/10.1609/AAAI.V39I14.33651\">10.1609/AAAI.V39I14.33651</a>.","bibtex":"@inproceedings{Mahmood_Hecher_Ngonga Ngomo_2024, title={Dung’s Argumentation Framework: Unveiling the Expressive Power with  Inconsistent Databases}, DOI={<a href=\"https://doi.org/10.1609/AAAI.V39I14.33651\">10.1609/AAAI.V39I14.33651</a>}, author={Mahmood, Yasir and Hecher, Markus and Ngonga Ngomo, Axel-Cyrille}, year={2024} }","short":"Y. Mahmood, M. Hecher, A.-C. Ngonga Ngomo, in: 2024.","ieee":"Y. Mahmood, M. Hecher, and A.-C. Ngonga Ngomo, “Dung’s Argumentation Framework: Unveiling the Expressive Power with  Inconsistent Databases,” 2024, doi: <a href=\"https://doi.org/10.1609/AAAI.V39I14.33651\">10.1609/AAAI.V39I14.33651</a>.","chicago":"Mahmood, Yasir, Markus Hecher, and Axel-Cyrille Ngonga Ngomo. “Dung’s Argumentation Framework: Unveiling the Expressive Power with  Inconsistent Databases,” 2024. <a href=\"https://doi.org/10.1609/AAAI.V39I14.33651\">https://doi.org/10.1609/AAAI.V39I14.33651</a>.","ama":"Mahmood Y, Hecher M, Ngonga Ngomo A-C. Dung’s Argumentation Framework: Unveiling the Expressive Power with  Inconsistent Databases. In: ; 2024. doi:<a href=\"https://doi.org/10.1609/AAAI.V39I14.33651\">10.1609/AAAI.V39I14.33651</a>"},"year":"2024","doi":"10.1609/AAAI.V39I14.33651","title":"Dung's Argumentation Framework: Unveiling the Expressive Power with  Inconsistent Databases","author":[{"first_name":"Yasir","id":"99353","full_name":"Mahmood, Yasir","last_name":"Mahmood"},{"full_name":"Hecher, Markus","last_name":"Hecher","first_name":"Markus"},{"first_name":"Axel-Cyrille","last_name":"Ngonga Ngomo","id":"65716","full_name":"Ngonga Ngomo, Axel-Cyrille"}],"date_created":"2025-01-27T15:30:41Z","date_updated":"2025-09-11T10:01:11Z","status":"public","abstract":[{"lang":"eng","text":"The connection between inconsistent databases and Dung's abstract\r\nargumentation framework has recently drawn growing interest. Specifically, an\r\ninconsistent database, involving certain types of integrity constraints such as\r\nfunctional and inclusion dependencies, can be viewed as an argumentation\r\nframework in Dung's setting. Nevertheless, no prior work has explored the exact\r\nexpressive power of Dung's theory of argumentation when compared to\r\ninconsistent databases and integrity constraints. In this paper, we close this\r\ngap by arguing that an argumentation framework can also be viewed as an\r\ninconsistent database. We first establish a connection between subset-repairs\r\nfor databases and extensions for AFs, considering conflict-free, naive,\r\nadmissible, and preferred semantics. Further, we define a new family of\r\nattribute-based repairs based on the principle of maximal content preservation.\r\nThe effectiveness of these repairs is then highlighted by connecting them to\r\nstable, semi-stable, and stage semantics. Our main contributions include\r\ntranslating an argumentation framework into a database together with integrity\r\nconstraints. Moreover, this translation can be achieved in polynomial time,\r\nwhich is essential in transferring complexity results between the two\r\nformalisms."}],"type":"conference","language":[{"iso":"eng"}],"user_id":"99353","department":[{"_id":"574"}],"project":[{"_id":"121","name":"TRR 318; TP B01: Ein dialogbasierter Ansatz zur Erklärung von Modellen des maschinellen Lernens"}],"external_id":{"arxiv":["2412.11617"]},"_id":"58377"},{"publication":"Frontiers in Artificial Intelligence and Applications","type":"book_chapter","abstract":[{"lang":"eng","text":"<jats:p>Abstract argumentation is a popular toolkit for modeling, evaluating, and comparing arguments. Relationships between arguments are specified in argumentation frameworks (AFs), and conditions are placed on sets (extensions) of arguments that allow AFs to be evaluated. For more expressiveness, AFs are augmented with acceptance conditions on directly interacting arguments or a constraint on the admissible sets of arguments, resulting in dialectic frameworks or constrained argumentation frameworks. In this paper, we consider flexible conditions for rejecting an argument from an extension, which we call rejection conditions (RCs). On the technical level, we associate each argument with a specific logic program. We analyze the resulting complexity, including the structural parameter treewidth. Rejection AFs are highly expressive, giving rise to natural problems on higher levels of the polynomial hierarchy.</jats:p>"}],"status":"public","_id":"57238","project":[{"name":"TRR 318; TP B01: Ein dialogbasierter Ansatz zur Erklärung von Modellen des maschinellen Lernens","_id":"121"}],"department":[{"_id":"574"}],"user_id":"99353","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0922-6389","1879-8314"],"isbn":["9781643685489"]},"publication_status":"published","year":"2024","citation":{"short":"J.K. Fichte, M. Hecher, Y. Mahmood, A. Meier, in: Frontiers in Artificial Intelligence and Applications, IOS Press, 2024.","bibtex":"@inbook{Fichte_Hecher_Mahmood_Meier_2024, title={Rejection in Abstract Argumentation: Harder Than Acceptance?}, DOI={<a href=\"https://doi.org/10.3233/faia240867\">10.3233/faia240867</a>}, booktitle={Frontiers in Artificial Intelligence and Applications}, publisher={IOS Press}, author={Fichte, Johannes K. and Hecher, Markus and Mahmood, Yasir and Meier, Arne}, year={2024} }","mla":"Fichte, Johannes K., et al. “Rejection in Abstract Argumentation: Harder Than Acceptance?” <i>Frontiers in Artificial Intelligence and Applications</i>, IOS Press, 2024, doi:<a href=\"https://doi.org/10.3233/faia240867\">10.3233/faia240867</a>.","apa":"Fichte, J. K., Hecher, M., Mahmood, Y., &#38; Meier, A. (2024). Rejection in Abstract Argumentation: Harder Than Acceptance? In <i>Frontiers in Artificial Intelligence and Applications</i>. ECAI} 2024 - 27th European Conference on Artificial Intelligence, Santiago de Compostela, Spain. IOS Press. <a href=\"https://doi.org/10.3233/faia240867\">https://doi.org/10.3233/faia240867</a>","ieee":"J. K. Fichte, M. Hecher, Y. Mahmood, and A. Meier, “Rejection in Abstract Argumentation: Harder Than Acceptance?,” in <i>Frontiers in Artificial Intelligence and Applications</i>, IOS Press, 2024.","chicago":"Fichte, Johannes K., Markus Hecher, Yasir Mahmood, and Arne Meier. “Rejection in Abstract Argumentation: Harder Than Acceptance?” In <i>Frontiers in Artificial Intelligence and Applications</i>. IOS Press, 2024. <a href=\"https://doi.org/10.3233/faia240867\">https://doi.org/10.3233/faia240867</a>.","ama":"Fichte JK, Hecher M, Mahmood Y, Meier A. Rejection in Abstract Argumentation: Harder Than Acceptance? In: <i>Frontiers in Artificial Intelligence and Applications</i>. IOS Press; 2024. doi:<a href=\"https://doi.org/10.3233/faia240867\">10.3233/faia240867</a>"},"date_updated":"2025-09-11T10:01:52Z","publisher":"IOS Press","author":[{"full_name":"Fichte, Johannes K.","last_name":"Fichte","first_name":"Johannes K."},{"last_name":"Hecher","full_name":"Hecher, Markus","first_name":"Markus"},{"full_name":"Mahmood, Yasir","id":"99353","last_name":"Mahmood","first_name":"Yasir"},{"first_name":"Arne","last_name":"Meier","full_name":"Meier, Arne"}],"date_created":"2024-11-19T11:46:55Z","title":"Rejection in Abstract Argumentation: Harder Than Acceptance?","conference":{"name":"ECAI} 2024 - 27th European Conference on Artificial Intelligence","location":"Santiago de Compostela, Spain"},"doi":"10.3233/faia240867"},{"citation":{"mla":"Hecher, Markus, et al. “Quantitative Claim-Centric Reasoning in Logic-Based Argumentation.” <i>Proceedings of the Thirty-ThirdInternational Joint Conference on Artificial Intelligence</i>, International Joint Conferences on Artificial Intelligence Organization, 2024, doi:<a href=\"https://doi.org/10.24963/ijcai.2024/377\">10.24963/ijcai.2024/377</a>.","bibtex":"@inproceedings{Hecher_Mahmood_Meier_Schmidt_2024, title={Quantitative Claim-Centric Reasoning in Logic-Based Argumentation}, DOI={<a href=\"https://doi.org/10.24963/ijcai.2024/377\">10.24963/ijcai.2024/377</a>}, booktitle={Proceedings of the Thirty-ThirdInternational Joint Conference on Artificial Intelligence}, publisher={International Joint Conferences on Artificial Intelligence Organization}, author={Hecher, Markus and Mahmood, Yasir and Meier, Arne and Schmidt, Johannes}, year={2024} }","short":"M. Hecher, Y. Mahmood, A. Meier, J. Schmidt, in: Proceedings of the Thirty-ThirdInternational Joint Conference on Artificial Intelligence, International Joint Conferences on Artificial Intelligence Organization, 2024.","apa":"Hecher, M., Mahmood, Y., Meier, A., &#38; Schmidt, J. (2024). Quantitative Claim-Centric Reasoning in Logic-Based Argumentation. <i>Proceedings of the Thirty-ThirdInternational Joint Conference on Artificial Intelligence</i>. <a href=\"https://doi.org/10.24963/ijcai.2024/377\">https://doi.org/10.24963/ijcai.2024/377</a>","chicago":"Hecher, Markus, Yasir Mahmood, Arne Meier, and Johannes Schmidt. “Quantitative Claim-Centric Reasoning in Logic-Based Argumentation.” In <i>Proceedings of the Thirty-ThirdInternational Joint Conference on Artificial Intelligence</i>. International Joint Conferences on Artificial Intelligence Organization, 2024. <a href=\"https://doi.org/10.24963/ijcai.2024/377\">https://doi.org/10.24963/ijcai.2024/377</a>.","ieee":"M. Hecher, Y. Mahmood, A. Meier, and J. Schmidt, “Quantitative Claim-Centric Reasoning in Logic-Based Argumentation,” 2024, doi: <a href=\"https://doi.org/10.24963/ijcai.2024/377\">10.24963/ijcai.2024/377</a>.","ama":"Hecher M, Mahmood Y, Meier A, Schmidt J. Quantitative Claim-Centric Reasoning in Logic-Based Argumentation. In: <i>Proceedings of the Thirty-ThirdInternational Joint Conference on Artificial Intelligence</i>. International Joint Conferences on Artificial Intelligence Organization; 2024. doi:<a href=\"https://doi.org/10.24963/ijcai.2024/377\">10.24963/ijcai.2024/377</a>"},"year":"2024","publication_status":"published","doi":"10.24963/ijcai.2024/377","title":"Quantitative Claim-Centric Reasoning in Logic-Based Argumentation","date_created":"2024-08-19T16:21:51Z","author":[{"full_name":"Hecher, Markus","last_name":"Hecher","first_name":"Markus"},{"first_name":"Yasir","last_name":"Mahmood","full_name":"Mahmood, Yasir","id":"99353"},{"full_name":"Meier, Arne","last_name":"Meier","first_name":"Arne"},{"first_name":"Johannes","last_name":"Schmidt","full_name":"Schmidt, Johannes"}],"publisher":"International Joint Conferences on Artificial Intelligence Organization","date_updated":"2025-09-11T10:02:03Z","status":"public","abstract":[{"lang":"eng","text":"<jats:p>Argumentation is a well-established formalism for nonmonotonic reasoning, with popular frameworks being Dung’s abstract argumentation (AFs) or logic-based argumentation (Besnard-Hunter’s framework). Structurally, a set of formulas forms support for a claim if it is consistent, subset-minimal, and implies the claim. Then, an argument comprises support and a claim. We observe that the computational task (ARG) of asking for support of a claim in a knowledge base is “brave”, since many claims with a single support are accepted. As a result, ARG falls short when it comes to the question of confidence in a claim, or claim strength. In this paper, we propose a concept for measuring the (acceptance) strength of claims, based on counting supports for a claim. Further, we settle classical and structural complexity of counting arguments favoring a given claim in propositional knowledge bases (KBs). We introduce quantitative reasoning to measure the strength of claims in a KB and to determine the relevance strength of a formula for a claim.</jats:p>"}],"publication":"Proceedings of the Thirty-ThirdInternational Joint Conference on Artificial Intelligence","type":"conference","language":[{"iso":"eng"}],"department":[{"_id":"574"}],"user_id":"99353","_id":"55655","project":[{"name":"TRR 318; TP B01: Ein dialogbasierter Ansatz zur Erklärung von Modellen des maschinellen Lernens","_id":"121"}]},{"date_updated":"2025-09-11T10:01:35Z","date_created":"2024-12-15T20:12:56Z","author":[{"last_name":"Hankala","full_name":"Hankala, Teemu","first_name":"Teemu"},{"first_name":"Miika","last_name":"Hannula","full_name":"Hannula, Miika"},{"last_name":"Mahmood","id":"99353","full_name":"Mahmood, Yasir","first_name":"Yasir"},{"full_name":"Meier, Arne","last_name":"Meier","first_name":"Arne"}],"title":"Parameterised Complexity of Consistent Query Answering via Graph  Representations","year":"2024","citation":{"chicago":"Hankala, Teemu, Miika Hannula, Yasir Mahmood, and Arne Meier. “Parameterised Complexity of Consistent Query Answering via Graph  Representations.” <i>ArXiv:2412.08324</i>, 2024.","ieee":"T. Hankala, M. Hannula, Y. Mahmood, and A. Meier, “Parameterised Complexity of Consistent Query Answering via Graph  Representations,” <i>arXiv:2412.08324</i>. 2024.","ama":"Hankala T, Hannula M, Mahmood Y, Meier A. Parameterised Complexity of Consistent Query Answering via Graph  Representations. <i>arXiv:241208324</i>. Published online 2024.","bibtex":"@article{Hankala_Hannula_Mahmood_Meier_2024, title={Parameterised Complexity of Consistent Query Answering via Graph  Representations}, journal={arXiv:2412.08324}, author={Hankala, Teemu and Hannula, Miika and Mahmood, Yasir and Meier, Arne}, year={2024} }","short":"T. Hankala, M. Hannula, Y. Mahmood, A. Meier, ArXiv:2412.08324 (2024).","mla":"Hankala, Teemu, et al. “Parameterised Complexity of Consistent Query Answering via Graph  Representations.” <i>ArXiv:2412.08324</i>, 2024.","apa":"Hankala, T., Hannula, M., Mahmood, Y., &#38; Meier, A. (2024). Parameterised Complexity of Consistent Query Answering via Graph  Representations. In <i>arXiv:2412.08324</i>."},"external_id":{"arxiv":["2412.08324"]},"_id":"57814","project":[{"name":"TRR 318; TP B01: Ein dialogbasierter Ansatz zur Erklärung von Modellen des maschinellen Lernens","_id":"121"}],"department":[{"_id":"574"}],"user_id":"99353","language":[{"iso":"eng"}],"publication":"arXiv:2412.08324","type":"preprint","abstract":[{"lang":"eng","text":"We study consistent query answering via different graph representations.\r\nFirst, we introduce solution-conflict hypergraphs in which nodes represent\r\nfacts and edges represent either conflicts or query solutions. Considering a\r\nmonotonic query and a set of antimonotonic constraints, we present an explicit\r\nalgorithm for counting the number of repairs satisfying the query based on a\r\ntree decomposition of the solution-conflict hypergraph. The algorithm not only\r\nprovides fixed-parameter tractability results for data complexity over\r\nexpressive query and constraint classes, but also introduces a novel and\r\npotentially implementable approach to repair counting. Second, we consider the\r\nGaifman graphs arising from MSO descriptions of consistent query answering.\r\nUsing a generalization of Courcelle's theorem, we then present fixed-parameter\r\ntractability results for combined complexity over expressive query and\r\nconstraint classes."}],"status":"public"},{"title":"Does Explainability Require Transparency?","doi":"10.6092/ISSN.1971-8853/15804","date_updated":"2024-02-26T08:46:26Z","date_created":"2024-02-18T10:16:43Z","author":[{"last_name":"Esposito","full_name":"Esposito, Elena ","first_name":"Elena "}],"volume":16,"year":"2023","citation":{"chicago":"Esposito, Elena . “Does Explainability Require Transparency?” <i>Sociologica</i> 16, no. 3 (2023): 17–27. <a href=\"https://doi.org/10.6092/ISSN.1971-8853/15804\">https://doi.org/10.6092/ISSN.1971-8853/15804</a>.","ieee":"E. Esposito, “Does Explainability Require Transparency?,” <i>Sociologica</i>, vol. 16, no. 3, pp. 17–27, 2023, doi: <a href=\"https://doi.org/10.6092/ISSN.1971-8853/15804\">10.6092/ISSN.1971-8853/15804</a>.","ama":"Esposito E. Does Explainability Require Transparency? <i>Sociologica</i>. 2023;16(3):17-27. doi:<a href=\"https://doi.org/10.6092/ISSN.1971-8853/15804\">10.6092/ISSN.1971-8853/15804</a>","bibtex":"@article{Esposito_2023, title={Does Explainability Require Transparency?}, volume={16}, DOI={<a href=\"https://doi.org/10.6092/ISSN.1971-8853/15804\">10.6092/ISSN.1971-8853/15804</a>}, number={3}, journal={Sociologica}, author={Esposito, Elena }, year={2023}, pages={17–27} }","mla":"Esposito, Elena. “Does Explainability Require Transparency?” <i>Sociologica</i>, vol. 16, no. 3, 2023, pp. 17–27, doi:<a href=\"https://doi.org/10.6092/ISSN.1971-8853/15804\">10.6092/ISSN.1971-8853/15804</a>.","short":"E. Esposito, Sociologica 16 (2023) 17–27.","apa":"Esposito, E. (2023). Does Explainability Require Transparency? <i>Sociologica</i>, <i>16</i>(3), 17–27. <a href=\"https://doi.org/10.6092/ISSN.1971-8853/15804\">https://doi.org/10.6092/ISSN.1971-8853/15804</a>"},"page":"17-27","intvolume":"        16","issue":"3","keyword":["Explainable AI","Transparency","Explanation","Communication","Sociological systems theory"],"language":[{"iso":"eng"}],"project":[{"_id":"121","name":"TRR 318 - B01: TRR 318 - Ein dialogbasierter Ansatz zur Erklärung von Modellen des maschinellen Lernens (Teilprojekt B01)","grant_number":"438445824"}],"_id":"51368","user_id":"54779","department":[{"_id":"660"}],"abstract":[{"text":"Dealing with opaque algorithms, the frequent overlap between transparency and explainability produces seemingly unsolvable dilemmas, as the much-discussed trade-off between model performance and model transparency. Referring to Niklas Luhmann's notion of communication, the paper argues that explainability does not necessarily require transparency and proposes an alternative approach. Explanations as communicative processes do not imply any disclosure of thoughts or neural processes, but only reformulations that provide the partners with additional elements and enable them to understand (from their perspective) what has been done and why. Recent computational approaches aiming at post-hoc explainability reproduce what happens in communication, producing explanations of the working of algorithms that can be different from the processes of the algorithms.","lang":"eng"}],"status":"public","type":"journal_article","publication":"Sociologica"},{"type":"journal_article","publication":"Sociologica","abstract":[{"text":"This short introduction presents the symposium ‘Explaining Machines’. It locates the debate about Explainable AI in the history of the reflection about AI and outlines the issues discussed in the contributions.","lang":"eng"}],"status":"public","project":[{"_id":"121","name":"TRR 318 - B01: TRR 318 - Ein dialogbasierter Ansatz zur Erklärung von Modellen des maschinellen Lernens (Teilprojekt B01)","grant_number":"438445824"}],"_id":"51369","user_id":"54779","department":[{"_id":"660"}],"keyword":["Explainable AI","Inexplicability","Transparency","Explanation","Opacity","Contestability"],"language":[{"iso":"eng"}],"issue":"3","year":"2023","citation":{"bibtex":"@article{Esposito_2023, title={Explaining Machines: Social Management of Incomprehensible Algorithms. Introduction}, volume={16}, DOI={<a href=\"https://doi.org/10.6092/ISSN.1971-8853/16265\">10.6092/ISSN.1971-8853/16265</a>}, number={3}, journal={Sociologica}, author={Esposito, Elena}, year={2023}, pages={1–4} }","short":"E. Esposito, Sociologica 16 (2023) 1–4.","mla":"Esposito, Elena. “Explaining Machines: Social Management of Incomprehensible Algorithms. Introduction.” <i>Sociologica</i>, vol. 16, no. 3, 2023, pp. 1–4, doi:<a href=\"https://doi.org/10.6092/ISSN.1971-8853/16265\">10.6092/ISSN.1971-8853/16265</a>.","apa":"Esposito, E. (2023). Explaining Machines: Social Management of Incomprehensible Algorithms. Introduction. <i>Sociologica</i>, <i>16</i>(3), 1–4. <a href=\"https://doi.org/10.6092/ISSN.1971-8853/16265\">https://doi.org/10.6092/ISSN.1971-8853/16265</a>","ama":"Esposito E. Explaining Machines: Social Management of Incomprehensible Algorithms. Introduction. <i>Sociologica</i>. 2023;16(3):1-4. doi:<a href=\"https://doi.org/10.6092/ISSN.1971-8853/16265\">10.6092/ISSN.1971-8853/16265</a>","chicago":"Esposito, Elena. “Explaining Machines: Social Management of Incomprehensible Algorithms. Introduction.” <i>Sociologica</i> 16, no. 3 (2023): 1–4. <a href=\"https://doi.org/10.6092/ISSN.1971-8853/16265\">https://doi.org/10.6092/ISSN.1971-8853/16265</a>.","ieee":"E. Esposito, “Explaining Machines: Social Management of Incomprehensible Algorithms. Introduction,” <i>Sociologica</i>, vol. 16, no. 3, pp. 1–4, 2023, doi: <a href=\"https://doi.org/10.6092/ISSN.1971-8853/16265\">10.6092/ISSN.1971-8853/16265</a>."},"intvolume":"        16","page":"1-4","date_updated":"2024-02-26T08:45:56Z","date_created":"2024-02-18T10:23:23Z","author":[{"first_name":"Elena","full_name":"Esposito, Elena","last_name":"Esposito"}],"volume":16,"title":"Explaining Machines: Social Management of Incomprehensible Algorithms. Introduction","doi":"10.6092/ISSN.1971-8853/16265"},{"oa":"1","date_updated":"2024-05-30T18:04:45Z","author":[{"last_name":"Sieger","full_name":"Sieger, Leonie Nora","id":"93402","first_name":"Leonie Nora"},{"first_name":"Julia","full_name":"Hermann, Julia","last_name":"Hermann"},{"full_name":"Schomäcker, Astrid","last_name":"Schomäcker","first_name":"Astrid"},{"first_name":"Stefan","full_name":"Heindorf, Stefan","id":"11871","last_name":"Heindorf","orcid":"0000-0002-4525-6865"},{"full_name":"Meske, Christian","last_name":"Meske","first_name":"Christian"},{"full_name":"Hey, Celine-Chiara","last_name":"Hey","first_name":"Celine-Chiara"},{"full_name":"Doğangün, Ayşegül","last_name":"Doğangün","first_name":"Ayşegül"}],"main_file_link":[{"open_access":"1","url":"https://papers.dice-research.org/2022/HAI_SmartHome/User_Involvement_in_Training_Smart_Home_Agents_public.pdf"}],"doi":"10.1145/3527188.3561914","conference":{"end_date":"2022-12-08","location":"Christchurch, New Zealand","name":"HAI '22: International Conference on Human-Agent Interaction","start_date":"2022-12-05"},"publication_status":"published","has_accepted_license":"1","citation":{"apa":"Sieger, L. N., Hermann, J., Schomäcker, A., Heindorf, S., Meske, C., Hey, C.-C., &#38; Doğangün, A. (2022). User Involvement in Training Smart Home Agents. <i>International Conference on Human-Agent Interaction</i>. HAI ’22: International Conference on Human-Agent Interaction, Christchurch, New Zealand. <a href=\"https://doi.org/10.1145/3527188.3561914\">https://doi.org/10.1145/3527188.3561914</a>","short":"L.N. Sieger, J. Hermann, A. Schomäcker, S. Heindorf, C. Meske, C.-C. Hey, A. Doğangün, in: International Conference on Human-Agent Interaction, ACM, 2022.","bibtex":"@inproceedings{Sieger_Hermann_Schomäcker_Heindorf_Meske_Hey_Doğangün_2022, title={User Involvement in Training Smart Home Agents}, DOI={<a href=\"https://doi.org/10.1145/3527188.3561914\">10.1145/3527188.3561914</a>}, booktitle={International Conference on Human-Agent Interaction}, publisher={ACM}, author={Sieger, Leonie Nora and Hermann, Julia and Schomäcker, Astrid and Heindorf, Stefan and Meske, Christian and Hey, Celine-Chiara and Doğangün, Ayşegül}, year={2022} }","mla":"Sieger, Leonie Nora, et al. “User Involvement in Training Smart Home Agents.” <i>International Conference on Human-Agent Interaction</i>, ACM, 2022, doi:<a href=\"https://doi.org/10.1145/3527188.3561914\">10.1145/3527188.3561914</a>.","ieee":"L. N. Sieger <i>et al.</i>, “User Involvement in Training Smart Home Agents,” presented at the HAI ’22: International Conference on Human-Agent Interaction, Christchurch, New Zealand, 2022, doi: <a href=\"https://doi.org/10.1145/3527188.3561914\">10.1145/3527188.3561914</a>.","chicago":"Sieger, Leonie Nora, Julia Hermann, Astrid Schomäcker, Stefan Heindorf, Christian Meske, Celine-Chiara Hey, and Ayşegül Doğangün. “User Involvement in Training Smart Home Agents.” In <i>International Conference on Human-Agent Interaction</i>. ACM, 2022. <a href=\"https://doi.org/10.1145/3527188.3561914\">https://doi.org/10.1145/3527188.3561914</a>.","ama":"Sieger LN, Hermann J, Schomäcker A, et al. User Involvement in Training Smart Home Agents. In: <i>International Conference on Human-Agent Interaction</i>. ACM; 2022. doi:<a href=\"https://doi.org/10.1145/3527188.3561914\">10.1145/3527188.3561914</a>"},"project":[{"grant_number":"438445824","name":"TRR 318 - B1: TRR 318 - Subproject B1","_id":"121"}],"_id":"34674","user_id":"11871","department":[{"_id":"574"},{"_id":"760"}],"alternative_title":["Increasing Perceived Control and Understanding"],"file_date_updated":"2024-05-30T18:04:31Z","type":"conference","status":"public","publisher":"ACM","date_created":"2022-12-21T09:48:43Z","title":"User Involvement in Training Smart Home Agents","quality_controlled":"1","year":"2022","ddc":["000"],"keyword":["human-agent interaction","smart homes","supervised learning","participation"],"language":[{"iso":"eng"}],"publication":"International Conference on Human-Agent Interaction","abstract":[{"lang":"eng","text":"Smart home systems contain plenty of features that enhance wellbeing in everyday life through artificial intelligence (AI). However, many users feel insecure because they do not understand the AI’s functionality and do not feel they are in control of it. Combining technical, psychological and philosophical views on AI, we rethink smart homes as interactive systems where users can partake in an intelligent agent’s learning. Parallel to the goals of explainable AI (XAI), we explored the possibility of user involvement in supervised learning of the smart home to have a first approach to improve acceptance, support subjective understanding and increase perceived control. In this work, we conducted two studies: In an online pre-study, we asked participants about their attitude towards teaching AI via a questionnaire. In the main study, we performed a Wizard of Oz laboratory experiment with human participants, where participants spent time in a prototypical smart home and taught activity recognition to the intelligent agent through supervised learning based on the user’s behaviour. We found that involvement in the AI’s learning phase enhanced the users’ feeling of control, perceived understanding and perceived usefulness of AI in general. The participants reported positive attitudes towards training a smart home AI and found the process understandable and controllable. We suggest that involving the user in the learning phase could lead to better personalisation and increased understanding and control by users of intelligent agents for smart home automation."}],"file":[{"file_size":1151728,"file_id":"54524","file_name":"User_Involvement_in_Training_Smart_Home_Agents_public.pdf","access_level":"closed","date_updated":"2024-05-30T18:04:31Z","creator":"heindorf","date_created":"2024-05-30T18:04:31Z","success":1,"relation":"main_file","content_type":"application/pdf"}]}]