[{"abstract":[{"text":"Structural measures of graphs, such as treewidth, are central tools in computational complexity resulting in efficient algorithms when exploiting the parameter. It is even known that modern SAT solvers work efficiently on instances of small treewidth. Since these solvers are widely applied, research interests in compact encodings into (Q)SAT for solving and to understand encoding limitations. Even more general is the graph parameter clique-width, which unlike treewidth can be small for dense graphs. Although algorithms are available for clique-width, little is known about encodings. We initiate the quest to understand encoding capabilities with clique-width by considering abstract argumentation, which is a robust framework for reasoning with conflicting arguments. It is based on directed graphs and asks for computationally challenging properties, making it a natural candidate to study computational properties. We design novel reductions from argumentation problems to (Q)SAT. Our reductions linearly preserve the clique-width, resulting in directed decomposition-guided (DDG) reductions. We establish novel results for all argumentation semantics, including counting. Notably, the overhead caused by our DDG reductions cannot be significantly improved under reasonable assumptions.","lang":"eng"}],"status":"public","publication":"Pre-print of paper accepted at AAAI 2026","type":"preprint","language":[{"iso":"eng"}],"external_id":{"arxiv":["2511.10767"]},"_id":"62723","department":[{"_id":"574"}],"user_id":"99353","year":"2026","citation":{"ieee":"Y. Mahmood, M. Hecher, J. Groven, and J. K. Fichte, “Structure-Aware Encodings of Argumentation Properties for Clique-width,” <i>Pre-print of paper accepted at AAAI 2026</i>. 2026.","chicago":"Mahmood, Yasir, Markus Hecher, Johanna Groven, and Johannes K. Fichte. “Structure-Aware Encodings of Argumentation Properties for Clique-Width.” <i>Pre-Print of Paper Accepted at AAAI 2026</i>, 2026.","ama":"Mahmood Y, Hecher M, Groven J, Fichte JK. Structure-Aware Encodings of Argumentation Properties for Clique-width. <i>Pre-print of paper accepted at AAAI 2026</i>. Published online 2026.","mla":"Mahmood, Yasir, et al. “Structure-Aware Encodings of Argumentation Properties for Clique-Width.” <i>Pre-Print of Paper Accepted at AAAI 2026</i>, 2026.","short":"Y. Mahmood, M. Hecher, J. Groven, J.K. Fichte, Pre-Print of Paper Accepted at AAAI 2026 (2026).","bibtex":"@article{Mahmood_Hecher_Groven_Fichte_2026, title={Structure-Aware Encodings of Argumentation Properties for Clique-width}, journal={Pre-print of paper accepted at AAAI 2026}, author={Mahmood, Yasir and Hecher, Markus and Groven, Johanna and Fichte, Johannes K.}, year={2026} }","apa":"Mahmood, Y., Hecher, M., Groven, J., &#38; Fichte, J. K. (2026). Structure-Aware Encodings of Argumentation Properties for Clique-width. In <i>Pre-print of paper accepted at AAAI 2026</i>."},"title":"Structure-Aware Encodings of Argumentation Properties for Clique-width","date_updated":"2025-12-04T21:09:06Z","date_created":"2025-12-01T12:05:05Z","author":[{"first_name":"Yasir","last_name":"Mahmood","full_name":"Mahmood, Yasir","id":"99353"},{"first_name":"Markus","last_name":"Hecher","full_name":"Hecher, Markus"},{"first_name":"Johanna","last_name":"Groven","full_name":"Groven, Johanna"},{"last_name":"Fichte","full_name":"Fichte, Johannes K.","first_name":"Johannes K."}]},{"title":"Can You Tell the Difference? Contrastive Explanations for ABox Entailments","date_updated":"2025-12-04T21:08:32Z","date_created":"2025-12-01T12:03:06Z","author":[{"last_name":"Koopmann","full_name":"Koopmann, Patrick","first_name":"Patrick"},{"full_name":"Mahmood, Yasir","id":"99353","last_name":"Mahmood","first_name":"Yasir"},{"first_name":"Axel-Cyrille","full_name":"Ngonga Ngomo, Axel-Cyrille","id":"65716","last_name":"Ngonga Ngomo"},{"first_name":"Balram","last_name":"Tiwari","full_name":"Tiwari, Balram"}],"year":"2026","citation":{"short":"P. Koopmann, Y. Mahmood, A.-C. Ngonga Ngomo, B. Tiwari, Pre-Print of Paper Accepted at AAAI 2026 (2026).","bibtex":"@article{Koopmann_Mahmood_Ngonga Ngomo_Tiwari_2026, title={Can You Tell the Difference? Contrastive Explanations for ABox Entailments}, journal={Pre-print of paper accepted at AAAI 2026}, author={Koopmann, Patrick and Mahmood, Yasir and Ngonga Ngomo, Axel-Cyrille and Tiwari, Balram}, year={2026} }","mla":"Koopmann, Patrick, et al. “Can You Tell the Difference? Contrastive Explanations for ABox Entailments.” <i>Pre-Print of Paper Accepted at AAAI 2026</i>, 2026.","apa":"Koopmann, P., Mahmood, Y., Ngonga Ngomo, A.-C., &#38; Tiwari, B. (2026). Can You Tell the Difference? Contrastive Explanations for ABox Entailments. In <i>Pre-print of paper accepted at AAAI 2026</i>.","chicago":"Koopmann, Patrick, Yasir Mahmood, Axel-Cyrille Ngonga Ngomo, and Balram Tiwari. “Can You Tell the Difference? Contrastive Explanations for ABox Entailments.” <i>Pre-Print of Paper Accepted at AAAI 2026</i>, 2026.","ieee":"P. Koopmann, Y. Mahmood, A.-C. Ngonga Ngomo, and B. Tiwari, “Can You Tell the Difference? Contrastive Explanations for ABox Entailments,” <i>Pre-print of paper accepted at AAAI 2026</i>. 2026.","ama":"Koopmann P, Mahmood Y, Ngonga Ngomo A-C, Tiwari B. Can You Tell the Difference? Contrastive Explanations for ABox Entailments. <i>Pre-print of paper accepted at AAAI 2026</i>. Published online 2026."},"language":[{"iso":"eng"}],"_id":"62721","external_id":{"arxiv":["2511.11281"]},"user_id":"99353","department":[{"_id":"574"}],"abstract":[{"text":"We introduce the notion of contrastive ABox explanations to answer questions of the type \"Why is a an instance of C, but b is not?\". While there are various approaches for explaining positive entailments (why is C(a) entailed by the knowledge base) as well as missing entailments (why is C(b) not entailed) in isolation, contrastive explanations consider both at the same time, which allows them to focus on the relevant commonalities and differences between a and b. We develop an appropriate notion of contrastive explanations for the special case of ABox reasoning with description logic ontologies, and analyze the computational complexity for different variants under different optimality criteria, considering lightweight as well as more expressive description logics. We implemented a first method for computing one variant of contrastive explanations, and evaluated it on generated problems for realistic knowledge bases.","lang":"eng"}],"status":"public","type":"preprint","publication":"Pre-print of paper accepted at AAAI 2026"},{"status":"public","type":"conference","publication":"The Semantic Web – 23rd European Semantic Web Conference, ESWC 2026, Dubrovnik , Croatia, May 10-14, 2026, Proceedings","language":[{"iso":"eng"}],"keyword":["dice hamada hashim kiakadamie mahmood manzoor ngonga rene sail saleem"],"user_id":"77309","department":[{"_id":"504"}],"project":[{"_id":"285","name":"SAIL - Nachhaltiger Lebenszyklus von intelligenten soziotechnischen Systemen"}],"_id":"65494","citation":{"ama":"Manzoor A, Zahera HM, Saleem M, et al. Document-level Relation Extraction using Reinforcement Learning with Knowledge Graph Feedback. In: <i>The Semantic Web – 23rd European Semantic Web Conference, ESWC 2026, Dubrovnik , Croatia, May 10-14, 2026, Proceedings</i>. ; 2026.","chicago":"Manzoor, Ali, Hammada M. Zahera, Muhammad Saleem, Yasir Mahmood, René Speck, Hashim Khan, and Axel-Cyrille Ngonga Ngomo. “Document-Level Relation Extraction Using Reinforcement Learning with Knowledge Graph Feedback.” In <i>The Semantic Web – 23rd European Semantic Web Conference, ESWC 2026, Dubrovnik , Croatia, May 10-14, 2026, Proceedings</i>, 2026.","ieee":"A. Manzoor <i>et al.</i>, “Document-level Relation Extraction using Reinforcement Learning with Knowledge Graph Feedback,” 2026.","short":"A. Manzoor, H.M. Zahera, M. Saleem, Y. Mahmood, R. Speck, H. Khan, A.-C. Ngonga Ngomo, in: The Semantic Web – 23rd European Semantic Web Conference, ESWC 2026, Dubrovnik , Croatia, May 10-14, 2026, Proceedings, 2026.","bibtex":"@inproceedings{Manzoor_Zahera_Saleem_Mahmood_Speck_Khan_Ngonga Ngomo_2026, title={Document-level Relation Extraction using Reinforcement Learning with Knowledge Graph Feedback}, booktitle={The Semantic Web – 23rd European Semantic Web Conference, ESWC 2026, Dubrovnik , Croatia, May 10-14, 2026, Proceedings}, author={Manzoor, Ali and Zahera, Hammada M. and Saleem, Muhammad and Mahmood, Yasir and Speck, René and Khan, Hashim and Ngonga Ngomo, Axel-Cyrille}, year={2026} }","mla":"Manzoor, Ali, et al. “Document-Level Relation Extraction Using Reinforcement Learning with Knowledge Graph Feedback.” <i>The Semantic Web – 23rd European Semantic Web Conference, ESWC 2026, Dubrovnik , Croatia, May 10-14, 2026, Proceedings</i>, 2026.","apa":"Manzoor, A., Zahera, H. M., Saleem, M., Mahmood, Y., Speck, R., Khan, H., &#38; Ngonga Ngomo, A.-C. (2026). Document-level Relation Extraction using Reinforcement Learning with Knowledge Graph Feedback. <i>The Semantic Web – 23rd European Semantic Web Conference, ESWC 2026, Dubrovnik , Croatia, May 10-14, 2026, Proceedings</i>."},"year":"2026","title":"Document-level Relation Extraction using Reinforcement Learning with Knowledge Graph Feedback","date_created":"2026-04-23T23:11:26Z","author":[{"first_name":"Ali","last_name":"Manzoor","orcid":"https://orcid.org/0000-0001-8403-5160","id":"77309","full_name":"Manzoor, Ali"},{"full_name":"Zahera, Hammada M.","last_name":"Zahera","first_name":"Hammada M."},{"first_name":"Muhammad","full_name":"Saleem, Muhammad","last_name":"Saleem"},{"last_name":"Mahmood","full_name":"Mahmood, Yasir","id":"99353","first_name":"Yasir"},{"first_name":"René","full_name":"Speck, René","id":"70843","last_name":"Speck"},{"orcid":"0009-0006-5953-480X","last_name":"Khan","id":"76510","full_name":"Khan, Hashim","first_name":"Hashim"},{"id":"65716","full_name":"Ngonga Ngomo, Axel-Cyrille","last_name":"Ngonga Ngomo","first_name":"Axel-Cyrille"}],"date_updated":"2026-04-23T23:14:33Z"},{"title":"Why not? Developing ABox Abduction beyond Repairs","date_updated":"2026-02-05T13:55:48Z","date_created":"2025-08-29T07:58:08Z","author":[{"first_name":"Anselm","id":"109969","full_name":"Haak, Anselm","last_name":"Haak"},{"first_name":"Patrick","last_name":"Koopmann","full_name":"Koopmann, Patrick"},{"last_name":"Mahmood","full_name":"Mahmood, Yasir","id":"99353","first_name":"Yasir"},{"first_name":"Anni-Yasmin","last_name":"Turhan","id":"104470","full_name":"Turhan, Anni-Yasmin"}],"year":"2025","citation":{"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} }","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).","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>.","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."},"language":[{"iso":"eng"}],"_id":"61065","external_id":{"arxiv":["2507.21955"]},"project":[{"_id":"121","name":"TRR 318; TP B01: Ein dialogbasierter Ansatz zur Erklärung von Modellen des maschinellen Lernens"}],"department":[{"_id":"574"},{"_id":"888"}],"user_id":"109969","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."}],"status":"public","publication":"arXiv:2507.21955","type":"preprint"},{"citation":{"chicago":"Haak, Anselm, Patrick Koopmann, Yasir Mahmood, and Anni-Yasmin Turhan. “Why Not? Developing ABox Abduction beyond Repairs.” In <i>Proceedings of the 38th International Workshop on Description Logics - DL 2025</i>, edited by Lidia Tendera, Yazmin Ibanez Garcia, and Patrick Koopmann, 2025.","ieee":"A. Haak, P. Koopmann, Y. Mahmood, and A.-Y. Turhan, “Why not? Developing ABox Abduction beyond Repairs,” in <i>Proceedings of the 38th International Workshop on Description Logics - DL 2025</i>, Opole, Poland, 2025.","ama":"Haak A, Koopmann P, Mahmood Y, Turhan A-Y. Why not? Developing ABox Abduction beyond Repairs. In: Tendera L, Ibanez Garcia Y, Koopmann P, eds. <i>Proceedings of the 38th International Workshop on Description Logics - DL 2025</i>. ; 2025.","short":"A. Haak, P. Koopmann, Y. Mahmood, A.-Y. Turhan, in: L. Tendera, Y. Ibanez Garcia, P. Koopmann (Eds.), Proceedings of the 38th International Workshop on Description Logics - DL 2025, 2025.","bibtex":"@inproceedings{Haak_Koopmann_Mahmood_Turhan_2025, title={Why not? Developing ABox Abduction beyond Repairs}, booktitle={Proceedings of the 38th International Workshop on Description Logics - DL 2025}, author={Haak, Anselm and Koopmann, Patrick and Mahmood, Yasir and Turhan, Anni-Yasmin}, editor={Tendera, Lidia and Ibanez Garcia, Yazmin and Koopmann, Patrick}, year={2025} }","mla":"Haak, Anselm, et al. “Why Not? Developing ABox Abduction beyond Repairs.” <i>Proceedings of the 38th International Workshop on Description Logics - DL 2025</i>, edited by Lidia Tendera et al., 2025.","apa":"Haak, A., Koopmann, P., Mahmood, Y., &#38; Turhan, A.-Y. (2025). Why not? Developing ABox Abduction beyond Repairs. In L. Tendera, Y. Ibanez Garcia, &#38; P. Koopmann (Eds.), <i>Proceedings of the 38th International Workshop on Description Logics - DL 2025</i>."},"year":"2025","main_file_link":[{"url":"https://ceur-ws.org/Vol-4091/paper25.pdf"}],"conference":{"start_date":"2025-09-03","name":"Description Logics 2025","location":"Opole, Poland","end_date":"2025-09-06"},"title":"Why not? Developing ABox Abduction beyond Repairs","date_created":"2026-02-05T13:54:08Z","author":[{"first_name":"Anselm","last_name":"Haak","id":"109969","full_name":"Haak, Anselm"},{"last_name":"Koopmann","full_name":"Koopmann, Patrick","first_name":"Patrick"},{"first_name":"Yasir","last_name":"Mahmood","full_name":"Mahmood, Yasir","id":"99353"},{"first_name":"Anni-Yasmin","last_name":"Turhan","id":"104470","full_name":"Turhan, Anni-Yasmin"}],"date_updated":"2026-02-05T13:55:27Z","status":"public","editor":[{"full_name":"Tendera, Lidia","last_name":"Tendera","first_name":"Lidia"},{"last_name":"Ibanez Garcia","full_name":"Ibanez Garcia, Yazmin","first_name":"Yazmin"},{"last_name":"Koopmann","full_name":"Koopmann, Patrick","first_name":"Patrick"}],"type":"conference","publication":"Proceedings of the 38th International Workshop on Description Logics - DL 2025","language":[{"iso":"eng"}],"user_id":"109969","department":[{"_id":"888"},{"_id":"574"}],"_id":"63888"},{"language":[{"iso":"eng"}],"abstract":[{"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>","lang":"eng"}],"publication":"Proceedings of the AAAI Conference on Artificial Intelligence","title":"Dung’s Argumentation Framework: Unveiling the Expressive Power with Inconsistent Databases","publisher":"Association for the Advancement of Artificial Intelligence (AAAI)","date_created":"2025-05-15T11:05:36Z","year":"2025","issue":"14","_id":"59910","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","status":"public","type":"conference","doi":"10.1609/aaai.v39i14.33651","date_updated":"2026-02-20T10:07:00Z","volume":39,"author":[{"id":"99353","full_name":"Mahmood, Yasir","last_name":"Mahmood","first_name":"Yasir"},{"full_name":"Hecher, Markus","last_name":"Hecher","first_name":"Markus"},{"id":"65716","full_name":"Ngonga Ngomo, Axel-Cyrille","last_name":"Ngonga Ngomo","first_name":"Axel-Cyrille"}],"intvolume":"        39","page":"15058-15066","citation":{"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>","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>.","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.","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>.","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>"},"publication_identifier":{"issn":["2374-3468","2159-5399"]},"publication_status":"published"},{"publication_identifier":{"issn":["0955-792X","1465-363X"]},"publication_status":"published","issue":"3","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>."},"publisher":"Oxford University Press (OUP)","date_updated":"2025-09-11T10:00:26Z","volume":35,"author":[{"first_name":"Miika","full_name":"Hannula, Miika","last_name":"Hannula"},{"first_name":"Minna","full_name":"Hirvonen, Minna","last_name":"Hirvonen"},{"last_name":"Kontinen","full_name":"Kontinen, Juha","first_name":"Juha"},{"first_name":"Yasir","full_name":"Mahmood, Yasir","id":"99353","last_name":"Mahmood"},{"first_name":"Arne","last_name":"Meier","full_name":"Meier, Arne"},{"full_name":"Virtema, Jonni","last_name":"Virtema","first_name":"Jonni"}],"date_created":"2025-05-15T11:07:28Z","title":"Logics with probabilistic team semantics and the Boolean negation","doi":"10.1093/logcom/exaf021","publication":"Journal of Logic and Computation","type":"journal_article","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","_id":"59912","project":[{"_id":"121","name":"TRR 318; TP B01: Ein dialogbasierter Ansatz zur Erklärung von Modellen des maschinellen Lernens"}],"department":[{"_id":"574"}],"user_id":"99353","language":[{"iso":"eng"}]},{"title":"Facets in Argumentation: A Formal Approach to Argument Significance","date_created":"2025-08-29T08:07:43Z","author":[{"full_name":"Fichte, Johannes","last_name":"Fichte","first_name":"Johannes"},{"first_name":"Nicolas","full_name":"Fröhlich, Nicolas","last_name":"Fröhlich"},{"first_name":"Markus","last_name":"Hecher","full_name":"Hecher, Markus"},{"last_name":"Lagerkvist","full_name":"Lagerkvist, Victor","first_name":"Victor"},{"first_name":"Yasir","last_name":"Mahmood","full_name":"Mahmood, Yasir","id":"99353"},{"first_name":"Arne","full_name":"Meier, Arne","last_name":"Meier"},{"last_name":"Persson","full_name":"Persson, Jonathan","first_name":"Jonathan"}],"date_updated":"2025-09-11T09:58:34Z","citation":{"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.","ieee":"J. Fichte <i>et al.</i>, “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.","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} }","mla":"Fichte, Johannes, et al. “Facets in Argumentation: A Formal Approach to Argument Significance.” <i>ArXiv:2505.10982</i>, 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","language":[{"iso":"eng"}],"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","status":"public","abstract":[{"lang":"eng","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."}],"type":"preprint","publication":"arXiv:2505.10982"},{"language":[{"iso":"eng"}],"user_id":"67199","department":[{"_id":"574"},{"_id":"923"}],"_id":"63572","status":"public","type":"conference","publication":"Lecture Notes in Computer Science","doi":"10.1007/978-3-032-06066-2_29","conference":{"name":"European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases","start_date":"2025-09-15","end_date":"2025-09-19","location":"Porto"},"title":"Tree-Based OWL Class Expression Learner over Large Graphs","author":[{"last_name":"Demir","id":"43817","full_name":"Demir, Caglar","first_name":"Caglar"},{"first_name":"Moshood Olawale","last_name":"Yekini","full_name":"Yekini, Moshood Olawale","id":"114533"},{"last_name":"Röder","orcid":"https://orcid.org/0000-0002-8609-8277","id":"67199","full_name":"Röder, Michael","first_name":"Michael"},{"last_name":"Mahmood","id":"99353","full_name":"Mahmood, Yasir","first_name":"Yasir"},{"last_name":"Ngonga Ngomo","id":"65716","full_name":"Ngonga Ngomo, Axel-Cyrille","first_name":"Axel-Cyrille"}],"date_created":"2026-01-12T17:13:22Z","date_updated":"2026-01-12T17:17:07Z","publisher":"Springer Nature Switzerland","citation":{"apa":"Demir, C., Yekini, M. O., Röder, M., Mahmood, Y., &#38; Ngonga Ngomo, A.-C. (2025). Tree-Based OWL Class Expression Learner over Large Graphs. <i>Lecture Notes in Computer Science</i>. European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, Porto. <a href=\"https://doi.org/10.1007/978-3-032-06066-2_29\">https://doi.org/10.1007/978-3-032-06066-2_29</a>","mla":"Demir, Caglar, et al. “Tree-Based OWL Class Expression Learner over Large Graphs.” <i>Lecture Notes in Computer Science</i>, Springer Nature Switzerland, 2025, doi:<a href=\"https://doi.org/10.1007/978-3-032-06066-2_29\">10.1007/978-3-032-06066-2_29</a>.","short":"C. Demir, M.O. Yekini, M. Röder, Y. Mahmood, A.-C. Ngonga Ngomo, in: Lecture Notes in Computer Science, Springer Nature Switzerland, Cham, 2025.","bibtex":"@inproceedings{Demir_Yekini_Röder_Mahmood_Ngonga Ngomo_2025, place={Cham}, title={Tree-Based OWL Class Expression Learner over Large Graphs}, DOI={<a href=\"https://doi.org/10.1007/978-3-032-06066-2_29\">10.1007/978-3-032-06066-2_29</a>}, booktitle={Lecture Notes in Computer Science}, publisher={Springer Nature Switzerland}, author={Demir, Caglar and Yekini, Moshood Olawale and Röder, Michael and Mahmood, Yasir and Ngonga Ngomo, Axel-Cyrille}, year={2025} }","ama":"Demir C, Yekini MO, Röder M, Mahmood Y, Ngonga Ngomo A-C. Tree-Based OWL Class Expression Learner over Large Graphs. In: <i>Lecture Notes in Computer Science</i>. Springer Nature Switzerland; 2025. doi:<a href=\"https://doi.org/10.1007/978-3-032-06066-2_29\">10.1007/978-3-032-06066-2_29</a>","ieee":"C. Demir, M. O. Yekini, M. Röder, Y. Mahmood, and A.-C. Ngonga Ngomo, “Tree-Based OWL Class Expression Learner over Large Graphs,” presented at the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, Porto, 2025, doi: <a href=\"https://doi.org/10.1007/978-3-032-06066-2_29\">10.1007/978-3-032-06066-2_29</a>.","chicago":"Demir, Caglar, Moshood Olawale Yekini, Michael Röder, Yasir Mahmood, and Axel-Cyrille Ngonga Ngomo. “Tree-Based OWL Class Expression Learner over Large Graphs.” In <i>Lecture Notes in Computer Science</i>. Cham: Springer Nature Switzerland, 2025. <a href=\"https://doi.org/10.1007/978-3-032-06066-2_29\">https://doi.org/10.1007/978-3-032-06066-2_29</a>."},"place":"Cham","year":"2025","publication_status":"published","publication_identifier":{"isbn":["9783032060655","9783032060662"],"issn":["0302-9743","1611-3349"]}},{"type":"book_chapter","publication":"Lecture Notes in Computer Science","status":"public","_id":"54580","user_id":"99353","department":[{"_id":"574"}],"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783031569395","9783031569401"]},"place":"Cham","year":"2024","citation":{"apa":"Mahmood, Y., Virtema, J., Barlag, T., &#38; Ngonga Ngomo, A.-C. (2024). Computing Repairs Under Functional and Inclusion Dependencies via Argumentation. In <i>Lecture Notes in Computer Science</i>. Springer Nature Switzerland. <a href=\"https://doi.org/10.1007/978-3-031-56940-1_2\">https://doi.org/10.1007/978-3-031-56940-1_2</a>","ama":"Mahmood Y, Virtema J, Barlag T, Ngonga Ngomo A-C. Computing Repairs Under Functional and Inclusion Dependencies via Argumentation. In: <i>Lecture Notes in Computer Science</i>. Springer Nature Switzerland; 2024. doi:<a href=\"https://doi.org/10.1007/978-3-031-56940-1_2\">10.1007/978-3-031-56940-1_2</a>","short":"Y. Mahmood, J. Virtema, T. Barlag, A.-C. Ngonga Ngomo, in: Lecture Notes in Computer Science, Springer Nature Switzerland, Cham, 2024.","mla":"Mahmood, Yasir, et al. “Computing Repairs Under Functional and Inclusion Dependencies via Argumentation.” <i>Lecture Notes in Computer Science</i>, Springer Nature Switzerland, 2024, doi:<a href=\"https://doi.org/10.1007/978-3-031-56940-1_2\">10.1007/978-3-031-56940-1_2</a>.","bibtex":"@inbook{Mahmood_Virtema_Barlag_Ngonga Ngomo_2024, place={Cham}, title={Computing Repairs Under Functional and Inclusion Dependencies via Argumentation}, DOI={<a href=\"https://doi.org/10.1007/978-3-031-56940-1_2\">10.1007/978-3-031-56940-1_2</a>}, booktitle={Lecture Notes in Computer Science}, publisher={Springer Nature Switzerland}, author={Mahmood, Yasir and Virtema, Jonni and Barlag, Timon and Ngonga Ngomo, Axel-Cyrille}, year={2024} }","chicago":"Mahmood, Yasir, Jonni Virtema, Timon Barlag, and Axel-Cyrille Ngonga Ngomo. “Computing Repairs Under Functional and Inclusion Dependencies via Argumentation.” In <i>Lecture Notes in Computer Science</i>. Cham: Springer Nature Switzerland, 2024. <a href=\"https://doi.org/10.1007/978-3-031-56940-1_2\">https://doi.org/10.1007/978-3-031-56940-1_2</a>.","ieee":"Y. Mahmood, J. Virtema, T. Barlag, and A.-C. Ngonga Ngomo, “Computing Repairs Under Functional and Inclusion Dependencies via Argumentation,” in <i>Lecture Notes in Computer Science</i>, Cham: Springer Nature Switzerland, 2024."},"publisher":"Springer Nature Switzerland","date_updated":"2024-06-04T15:53:59Z","date_created":"2024-06-04T10:01:16Z","author":[{"id":"99353","full_name":"Mahmood, Yasir","last_name":"Mahmood","first_name":"Yasir"},{"first_name":"Jonni","last_name":"Virtema","full_name":"Virtema, Jonni"},{"first_name":"Timon","last_name":"Barlag","full_name":"Barlag, Timon"},{"first_name":"Axel-Cyrille","last_name":"Ngonga Ngomo","id":"65716","full_name":"Ngonga Ngomo, Axel-Cyrille"}],"title":"Computing Repairs Under Functional and Inclusion Dependencies via Argumentation","doi":"10.1007/978-3-031-56940-1_2"},{"_id":"54092","department":[{"_id":"574"}],"user_id":"99353","keyword":["dice mahmood"],"language":[{"iso":"eng"}],"publication":"Mathematical Structures in Computer Science","type":"journal_article","status":"public","date_updated":"2024-09-17T15:25:54Z","publisher":"Cambridge University Press","author":[{"first_name":"Juha","full_name":"Kontinen, Juha","last_name":"Kontinen"},{"last_name":"Mahmood","id":"99353","full_name":"Mahmood, Yasir","first_name":"Yasir"},{"full_name":"Meier, Arne","last_name":"Meier","first_name":"Arne"},{"first_name":"Heribert","full_name":"Vollmer, Heribert","last_name":"Vollmer"}],"date_created":"2024-05-08T13:24:17Z","title":"Parameterized Complexity of Weighted Team Definability","doi":"10.1017/S0960129524000033","year":"2024","page":"1-15","citation":{"apa":"Kontinen, J., Mahmood, Y., Meier, A., &#38; Vollmer, H. (2024). Parameterized Complexity of Weighted Team Definability. <i>Mathematical Structures in Computer Science</i>, 1–15. <a href=\"https://doi.org/10.1017/S0960129524000033\">https://doi.org/10.1017/S0960129524000033</a>","bibtex":"@article{Kontinen_Mahmood_Meier_Vollmer_2024, title={Parameterized Complexity of Weighted Team Definability}, DOI={<a href=\"https://doi.org/10.1017/S0960129524000033\">10.1017/S0960129524000033</a>}, journal={Mathematical Structures in Computer Science}, publisher={Cambridge University Press}, author={Kontinen, Juha and Mahmood, Yasir and Meier, Arne and Vollmer, Heribert}, year={2024}, pages={1–15} }","mla":"Kontinen, Juha, et al. “Parameterized Complexity of Weighted Team Definability.” <i>Mathematical Structures in Computer Science</i>, Cambridge University Press, 2024, pp. 1–15, doi:<a href=\"https://doi.org/10.1017/S0960129524000033\">10.1017/S0960129524000033</a>.","short":"J. Kontinen, Y. Mahmood, A. Meier, H. Vollmer, Mathematical Structures in Computer Science (2024) 1–15.","ieee":"J. Kontinen, Y. Mahmood, A. Meier, and H. Vollmer, “Parameterized Complexity of Weighted Team Definability,” <i>Mathematical Structures in Computer Science</i>, pp. 1–15, 2024, doi: <a href=\"https://doi.org/10.1017/S0960129524000033\">10.1017/S0960129524000033</a>.","chicago":"Kontinen, Juha, Yasir Mahmood, Arne Meier, and Heribert Vollmer. “Parameterized Complexity of Weighted Team Definability.” <i>Mathematical Structures in Computer Science</i>, 2024, 1–15. <a href=\"https://doi.org/10.1017/S0960129524000033\">https://doi.org/10.1017/S0960129524000033</a>.","ama":"Kontinen J, Mahmood Y, Meier A, Vollmer H. Parameterized Complexity of Weighted Team Definability. <i>Mathematical Structures in Computer Science</i>. Published online 2024:1-15. doi:<a href=\"https://doi.org/10.1017/S0960129524000033\">10.1017/S0960129524000033</a>"}},{"publisher":"Cambridge University Press (CUP)","date_created":"2025-05-15T11:06:56Z","title":"Parameterized complexity of weighted team definability","issue":"5","year":"2024","language":[{"iso":"eng"}],"publication":"Mathematical Structures in Computer Science","abstract":[{"lang":"eng","text":"<jats:title>Abstract</jats:title><jats:p>In this article, we study the complexity of weighted team definability for logics with team semantics. This problem is a natural analog of one of the most studied problems in parameterized complexity, the notion of weighted Fagin-definability, which is formulated in terms of satisfaction of first-order formulas with free relation variables. We focus on the parameterized complexity of weighted team definability for a fixed formula <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0960129524000033_inline1.png\"/><jats:tex-math>\r\n$\\varphi$\r\n</jats:tex-math></jats:alternatives></jats:inline-formula> of central team-based logics. Given a first-order structure <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0960129524000033_inline2.png\"/><jats:tex-math>\r\n$\\mathcal{A}$\r\n</jats:tex-math></jats:alternatives></jats:inline-formula> and the parameter value <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0960129524000033_inline3.png\"/><jats:tex-math>\r\n$k\\in \\mathbb N$\r\n</jats:tex-math></jats:alternatives></jats:inline-formula> as input, the question is to determine whether <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http://www.w3.org/1999/xlink\" mime-subtype=\"png\" xlink:href=\"S0960129524000033_inline4.png\"/><jats:tex-math>\r\n$\\mathcal{A},T\\models \\varphi$\r\n</jats:tex-math></jats:alternatives></jats:inline-formula> for some team <jats:italic>T</jats:italic> of size <jats:italic>k</jats:italic>. We show several results on the complexity of this problem for dependence, independence, and inclusion logic formulas. Moreover, we also relate the complexity of weighted team definability to the complexity classes in the well-known W-hierarchy as well as paraNP.</jats:p>"}],"date_updated":"2025-05-15T11:07:08Z","volume":34,"author":[{"full_name":"Kontinen, Juha","last_name":"Kontinen","first_name":"Juha"},{"first_name":"Yasir","id":"99353","full_name":"Mahmood, Yasir","last_name":"Mahmood"},{"first_name":"Arne","last_name":"Meier","full_name":"Meier, Arne"},{"first_name":"Heribert","last_name":"Vollmer","full_name":"Vollmer, Heribert"}],"doi":"10.1017/s0960129524000033","publication_identifier":{"issn":["0960-1295","1469-8072"]},"publication_status":"published","page":"375-389","intvolume":"        34","citation":{"ieee":"J. Kontinen, Y. Mahmood, A. Meier, and H. Vollmer, “Parameterized complexity of weighted team definability,” <i>Mathematical Structures in Computer Science</i>, vol. 34, no. 5, pp. 375–389, 2024, doi: <a href=\"https://doi.org/10.1017/s0960129524000033\">10.1017/s0960129524000033</a>.","chicago":"Kontinen, Juha, Yasir Mahmood, Arne Meier, and Heribert Vollmer. “Parameterized Complexity of Weighted Team Definability.” <i>Mathematical Structures in Computer Science</i> 34, no. 5 (2024): 375–89. <a href=\"https://doi.org/10.1017/s0960129524000033\">https://doi.org/10.1017/s0960129524000033</a>.","ama":"Kontinen J, Mahmood Y, Meier A, Vollmer H. Parameterized complexity of weighted team definability. <i>Mathematical Structures in Computer Science</i>. 2024;34(5):375-389. doi:<a href=\"https://doi.org/10.1017/s0960129524000033\">10.1017/s0960129524000033</a>","short":"J. Kontinen, Y. Mahmood, A. Meier, H. Vollmer, Mathematical Structures in Computer Science 34 (2024) 375–389.","bibtex":"@article{Kontinen_Mahmood_Meier_Vollmer_2024, title={Parameterized complexity of weighted team definability}, volume={34}, DOI={<a href=\"https://doi.org/10.1017/s0960129524000033\">10.1017/s0960129524000033</a>}, number={5}, journal={Mathematical Structures in Computer Science}, publisher={Cambridge University Press (CUP)}, author={Kontinen, Juha and Mahmood, Yasir and Meier, Arne and Vollmer, Heribert}, year={2024}, pages={375–389} }","mla":"Kontinen, Juha, et al. “Parameterized Complexity of Weighted Team Definability.” <i>Mathematical Structures in Computer Science</i>, vol. 34, no. 5, Cambridge University Press (CUP), 2024, pp. 375–89, doi:<a href=\"https://doi.org/10.1017/s0960129524000033\">10.1017/s0960129524000033</a>.","apa":"Kontinen, J., Mahmood, Y., Meier, A., &#38; Vollmer, H. (2024). Parameterized complexity of weighted team definability. <i>Mathematical Structures in Computer Science</i>, <i>34</i>(5), 375–389. <a href=\"https://doi.org/10.1017/s0960129524000033\">https://doi.org/10.1017/s0960129524000033</a>"},"_id":"59911","department":[{"_id":"574"}],"user_id":"99353","type":"journal_article","status":"public"},{"title":"Dung's Argumentation Framework: Unveiling the Expressive Power with  Inconsistent Databases","doi":"10.1609/AAAI.V39I14.33651","date_updated":"2025-09-11T10:01:11Z","author":[{"first_name":"Yasir","last_name":"Mahmood","full_name":"Mahmood, Yasir","id":"99353"},{"first_name":"Markus","full_name":"Hecher, Markus","last_name":"Hecher"},{"first_name":"Axel-Cyrille","id":"65716","full_name":"Ngonga Ngomo, Axel-Cyrille","last_name":"Ngonga Ngomo"}],"date_created":"2025-01-27T15:30:41Z","year":"2024","citation":{"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.","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>","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>"},"language":[{"iso":"eng"}],"external_id":{"arxiv":["2412.11617"]},"_id":"58377","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":"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."}],"status":"public","type":"conference"},{"status":"public","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>"}],"publication":"Frontiers in Artificial Intelligence and Applications","type":"book_chapter","language":[{"iso":"eng"}],"department":[{"_id":"574"}],"user_id":"99353","_id":"57238","project":[{"name":"TRR 318; TP B01: Ein dialogbasierter Ansatz zur Erklärung von Modellen des maschinellen Lernens","_id":"121"}],"citation":{"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>.","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} }","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>","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>","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>."},"year":"2024","publication_identifier":{"isbn":["9781643685489"],"issn":["0922-6389","1879-8314"]},"publication_status":"published","doi":"10.3233/faia240867","conference":{"name":"ECAI} 2024 - 27th European Conference on Artificial Intelligence","location":"Santiago de Compostela, Spain"},"title":"Rejection in Abstract Argumentation: Harder Than Acceptance?","date_created":"2024-11-19T11:46:55Z","author":[{"last_name":"Fichte","full_name":"Fichte, Johannes K.","first_name":"Johannes K."},{"last_name":"Hecher","full_name":"Hecher, Markus","first_name":"Markus"},{"first_name":"Yasir","last_name":"Mahmood","id":"99353","full_name":"Mahmood, Yasir"},{"full_name":"Meier, Arne","last_name":"Meier","first_name":"Arne"}],"date_updated":"2025-09-11T10:01:52Z","publisher":"IOS Press"},{"publication_status":"published","year":"2024","citation":{"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>","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} }","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>.","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.","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>","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>."},"publisher":"International Joint Conferences on Artificial Intelligence Organization","date_updated":"2025-09-11T10:02:03Z","date_created":"2024-08-19T16:21:51Z","author":[{"first_name":"Markus","last_name":"Hecher","full_name":"Hecher, Markus"},{"full_name":"Mahmood, Yasir","id":"99353","last_name":"Mahmood","first_name":"Yasir"},{"last_name":"Meier","full_name":"Meier, Arne","first_name":"Arne"},{"first_name":"Johannes","last_name":"Schmidt","full_name":"Schmidt, Johannes"}],"title":"Quantitative Claim-Centric Reasoning in Logic-Based Argumentation","doi":"10.24963/ijcai.2024/377","publication":"Proceedings of the Thirty-ThirdInternational Joint Conference on Artificial Intelligence","type":"conference","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>"}],"status":"public","_id":"55655","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"}]},{"year":"2024","citation":{"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>.","mla":"Hankala, Teemu, et al. “Parameterised Complexity of Consistent Query Answering via Graph  Representations.” <i>ArXiv:2412.08324</i>, 2024.","short":"T. Hankala, M. Hannula, Y. Mahmood, A. Meier, ArXiv:2412.08324 (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} }","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."},"date_updated":"2025-09-11T10:01:35Z","author":[{"last_name":"Hankala","full_name":"Hankala, Teemu","first_name":"Teemu"},{"first_name":"Miika","full_name":"Hannula, Miika","last_name":"Hannula"},{"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-12-15T20:12:56Z","title":"Parameterised Complexity of Consistent Query Answering via Graph  Representations","type":"preprint","publication":"arXiv:2412.08324","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","project":[{"name":"TRR 318; TP B01: Ein dialogbasierter Ansatz zur Erklärung von Modellen des maschinellen Lernens","_id":"121"}],"external_id":{"arxiv":["2412.08324"]},"_id":"57814","user_id":"99353","department":[{"_id":"574"}],"language":[{"iso":"eng"}]},{"publication":"ACM Transactions on Computational Logic","type":"journal_article","abstract":[{"text":"<jats:p>Argumentation is a well-established formalism dealing with conflicting information by generating and comparing arguments. It has been playing a major role in AI for decades. In logic-based argumentation, we explore the internal structure of an argument. Informally, a set of formulas is the support for a given claim if it is consistent, subset-minimal, and implies the claim. In such a case, the pair of the support and the claim together is called an argument. In this article, we study the propositional variants of the following three computational tasks studied in argumentation: ARG (exists a support for a given claim with respect to a given set of formulas), ARG-Check (is a given set a support for a given claim), and ARG-Rel (similarly as ARG plus requiring an additionally given formula to be contained in the support). ARG-Check is complete for the complexity class DP, and the other two problems are known to be complete for the second level of the polynomial hierarchy (Creignou et al. 2014 and Parson et al., 2003) and, accordingly, are highly intractable. Analyzing the reason for this intractability, we perform a two-dimensional classification: First, we consider all possible propositional fragments of the problem within Schaefer’s framework (STOC 1978) and then study different parameterizations for each of the fragments. We identify a list of reasonable structural parameters (size of the claim, support, knowledge base) that are connected to the aforementioned decision problems. Eventually, we thoroughly draw a fine border of parameterized intractability for each of the problems showing where the problems are fixed-parameter tractable and when this exactly stops. Surprisingly, several cases are of very high intractability (para-NP and beyond).</jats:p>","lang":"eng"}],"status":"public","_id":"54577","department":[{"_id":"574"}],"user_id":"99353","language":[{"iso":"eng"}],"publication_identifier":{"issn":["1529-3785","1557-945X"]},"publication_status":"published","issue":"3","year":"2023","intvolume":"        24","page":"1-25","citation":{"mla":"Mahmood, Yasir, et al. “Parameterized Complexity of Logic-Based Argumentation in Schaefer’s Framework.” <i>ACM Transactions on Computational Logic</i>, vol. 24, no. 3, Association for Computing Machinery (ACM), 2023, pp. 1–25, doi:<a href=\"https://doi.org/10.1145/3582499\">10.1145/3582499</a>.","bibtex":"@article{Mahmood_Meier_Schmidt_2023, title={Parameterized Complexity of Logic-based Argumentation in Schaefer’s Framework}, volume={24}, DOI={<a href=\"https://doi.org/10.1145/3582499\">10.1145/3582499</a>}, number={3}, journal={ACM Transactions on Computational Logic}, publisher={Association for Computing Machinery (ACM)}, author={Mahmood, Yasir and Meier, Arne and Schmidt, Johannes}, year={2023}, pages={1–25} }","short":"Y. Mahmood, A. Meier, J. Schmidt, ACM Transactions on Computational Logic 24 (2023) 1–25.","apa":"Mahmood, Y., Meier, A., &#38; Schmidt, J. (2023). Parameterized Complexity of Logic-based Argumentation in Schaefer’s Framework. <i>ACM Transactions on Computational Logic</i>, <i>24</i>(3), 1–25. <a href=\"https://doi.org/10.1145/3582499\">https://doi.org/10.1145/3582499</a>","ama":"Mahmood Y, Meier A, Schmidt J. Parameterized Complexity of Logic-based Argumentation in Schaefer’s Framework. <i>ACM Transactions on Computational Logic</i>. 2023;24(3):1-25. doi:<a href=\"https://doi.org/10.1145/3582499\">10.1145/3582499</a>","ieee":"Y. Mahmood, A. Meier, and J. Schmidt, “Parameterized Complexity of Logic-based Argumentation in Schaefer’s Framework,” <i>ACM Transactions on Computational Logic</i>, vol. 24, no. 3, pp. 1–25, 2023, doi: <a href=\"https://doi.org/10.1145/3582499\">10.1145/3582499</a>.","chicago":"Mahmood, Yasir, Arne Meier, and Johannes Schmidt. “Parameterized Complexity of Logic-Based Argumentation in Schaefer’s Framework.” <i>ACM Transactions on Computational Logic</i> 24, no. 3 (2023): 1–25. <a href=\"https://doi.org/10.1145/3582499\">https://doi.org/10.1145/3582499</a>."},"publisher":"Association for Computing Machinery (ACM)","date_updated":"2024-06-04T15:52:54Z","volume":24,"date_created":"2024-06-04T09:58:17Z","author":[{"first_name":"Yasir","full_name":"Mahmood, Yasir","id":"99353","last_name":"Mahmood"},{"last_name":"Meier","full_name":"Meier, Arne","first_name":"Arne"},{"last_name":"Schmidt","full_name":"Schmidt, Johannes","first_name":"Johannes"}],"title":"Parameterized Complexity of Logic-based Argumentation in Schaefer’s Framework","doi":"10.1145/3582499"},{"publication_status":"published","citation":{"apa":"Fichte, J. K., Hecher, M., Mahmood, Y., &#38; Meier, A. (2023). Quantitative Reasoning and Structural Complexity for Claim-Centric Argumentation. <i>Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence</i>. <a href=\"https://doi.org/10.24963/ijcai.2023/358\">https://doi.org/10.24963/ijcai.2023/358</a>","bibtex":"@inproceedings{Fichte_Hecher_Mahmood_Meier_2023, title={Quantitative Reasoning and Structural Complexity for Claim-Centric Argumentation}, DOI={<a href=\"https://doi.org/10.24963/ijcai.2023/358\">10.24963/ijcai.2023/358</a>}, booktitle={Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence}, publisher={International Joint Conferences on Artificial Intelligence Organization}, author={Fichte, Johannes K. and Hecher, Markus and Mahmood, Yasir and Meier, Arne}, year={2023} }","short":"J.K. Fichte, M. Hecher, Y. Mahmood, A. Meier, in: Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, International Joint Conferences on Artificial Intelligence Organization, 2023.","mla":"Fichte, Johannes K., et al. “Quantitative Reasoning and Structural Complexity for Claim-Centric Argumentation.” <i>Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence</i>, International Joint Conferences on Artificial Intelligence Organization, 2023, doi:<a href=\"https://doi.org/10.24963/ijcai.2023/358\">10.24963/ijcai.2023/358</a>.","ama":"Fichte JK, Hecher M, Mahmood Y, Meier A. Quantitative Reasoning and Structural Complexity for Claim-Centric Argumentation. In: <i>Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence</i>. International Joint Conferences on Artificial Intelligence Organization; 2023. doi:<a href=\"https://doi.org/10.24963/ijcai.2023/358\">10.24963/ijcai.2023/358</a>","chicago":"Fichte, Johannes K., Markus Hecher, Yasir Mahmood, and Arne Meier. “Quantitative Reasoning and Structural Complexity for Claim-Centric Argumentation.” In <i>Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence</i>. International Joint Conferences on Artificial Intelligence Organization, 2023. <a href=\"https://doi.org/10.24963/ijcai.2023/358\">https://doi.org/10.24963/ijcai.2023/358</a>.","ieee":"J. K. Fichte, M. Hecher, Y. Mahmood, and A. Meier, “Quantitative Reasoning and Structural Complexity for Claim-Centric Argumentation,” 2023, doi: <a href=\"https://doi.org/10.24963/ijcai.2023/358\">10.24963/ijcai.2023/358</a>."},"year":"2023","date_created":"2024-06-04T09:59:01Z","author":[{"first_name":"Johannes K.","full_name":"Fichte, Johannes K.","last_name":"Fichte"},{"first_name":"Markus","full_name":"Hecher, Markus","last_name":"Hecher"},{"first_name":"Yasir","last_name":"Mahmood","id":"99353","full_name":"Mahmood, Yasir"},{"full_name":"Meier, Arne","last_name":"Meier","first_name":"Arne"}],"date_updated":"2024-06-04T15:53:02Z","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi":"10.24963/ijcai.2023/358","title":"Quantitative Reasoning and Structural Complexity for Claim-Centric Argumentation","publication":"Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence","type":"conference","status":"public","abstract":[{"lang":"eng","text":"<jats:p>Argumentation is a well-established formalism for nonmonotonic reasoning and a vibrant area of research in AI. Claim-augmented argumentation frameworks (CAFs) have been introduced to deploy a conclusion-oriented perspective. CAFs expand argumentation frameworks by an additional step which involves retaining claims for an accepted set of arguments. We introduce a novel concept of a justification status for claims, a quantitative measure of extensions supporting a particular claim. The well-studied problems of credulous and skeptical reasoning can then be seen as simply the two endpoints of the spectrum when considered as a justification level of a claim. Furthermore, we explore the parameterized complexity of various reasoning problems for CAFs, including the quantitative reasoning for claim assertions. We begin by presenting a suitable graph representation that includes arguments and their associated claims. Our analysis includes the parameter treewidth, and we present decomposition-guided reductions between reasoning problems in CAF and the validity problem for QBF.</jats:p>"}],"department":[{"_id":"574"}],"user_id":"99353","_id":"54578","language":[{"iso":"eng"}]},{"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783031397837","9783031397844"]},"publication_status":"published","citation":{"bibtex":"@inbook{Mahmood_Virtema_2023, place={Cham}, title={Parameterized Complexity of Propositional Inclusion and Independence Logic}, DOI={<a href=\"https://doi.org/10.1007/978-3-031-39784-4_17\">10.1007/978-3-031-39784-4_17</a>}, booktitle={Logic, Language, Information, and Computation}, publisher={Springer Nature Switzerland}, author={Mahmood, Yasir and Virtema, Jonni}, year={2023} }","short":"Y. Mahmood, J. Virtema, in: Logic, Language, Information, and Computation, Springer Nature Switzerland, Cham, 2023.","mla":"Mahmood, Yasir, and Jonni Virtema. “Parameterized Complexity of Propositional Inclusion and Independence Logic.” <i>Logic, Language, Information, and Computation</i>, Springer Nature Switzerland, 2023, doi:<a href=\"https://doi.org/10.1007/978-3-031-39784-4_17\">10.1007/978-3-031-39784-4_17</a>.","apa":"Mahmood, Y., &#38; Virtema, J. (2023). Parameterized Complexity of Propositional Inclusion and Independence Logic. In <i>Logic, Language, Information, and Computation</i>. Springer Nature Switzerland. <a href=\"https://doi.org/10.1007/978-3-031-39784-4_17\">https://doi.org/10.1007/978-3-031-39784-4_17</a>","chicago":"Mahmood, Yasir, and Jonni Virtema. “Parameterized Complexity of Propositional Inclusion and Independence Logic.” In <i>Logic, Language, Information, and Computation</i>. Cham: Springer Nature Switzerland, 2023. <a href=\"https://doi.org/10.1007/978-3-031-39784-4_17\">https://doi.org/10.1007/978-3-031-39784-4_17</a>.","ieee":"Y. Mahmood and J. Virtema, “Parameterized Complexity of Propositional Inclusion and Independence Logic,” in <i>Logic, Language, Information, and Computation</i>, Cham: Springer Nature Switzerland, 2023.","ama":"Mahmood Y, Virtema J. Parameterized Complexity of Propositional Inclusion and Independence Logic. In: <i>Logic, Language, Information, and Computation</i>. Springer Nature Switzerland; 2023. doi:<a href=\"https://doi.org/10.1007/978-3-031-39784-4_17\">10.1007/978-3-031-39784-4_17</a>"},"year":"2023","place":"Cham","date_created":"2024-06-04T09:59:47Z","author":[{"last_name":"Mahmood","id":"99353","full_name":"Mahmood, Yasir","first_name":"Yasir"},{"last_name":"Virtema","full_name":"Virtema, Jonni","first_name":"Jonni"}],"date_updated":"2024-06-04T15:52:48Z","publisher":"Springer Nature Switzerland","doi":"10.1007/978-3-031-39784-4_17","title":"Parameterized Complexity of Propositional Inclusion and Independence Logic","publication":"Logic, Language, Information, and Computation","type":"book_chapter","status":"public","department":[{"_id":"574"}],"user_id":"99353","_id":"54579","language":[{"iso":"eng"}]},{"citation":{"ama":"Hannula M, Hirvonen M, Kontinen J, Mahmood Y, Meier A, Virtema J. Logics with probabilistic team semantics and the Boolean negation. In: <i>18th European Conference on Logics in Artificial Intelligence, JELIA 2023, Proceedings</i>. ; 2023.","ieee":"M. Hannula, M. Hirvonen, J. Kontinen, Y. Mahmood, A. Meier, and J. Virtema, “Logics with probabilistic team semantics and the Boolean negation,” 2023.","chicago":"Hannula, Miika, Minna Hirvonen, Juha Kontinen, Yasir Mahmood, Arne Meier, and Jonni Virtema. “Logics with Probabilistic Team Semantics and the Boolean Negation.” In <i>18th European Conference on Logics in Artificial Intelligence, JELIA 2023, Proceedings</i>, 2023.","short":"M. Hannula, M. Hirvonen, J. Kontinen, Y. Mahmood, A. Meier, J. Virtema, in: 18th European Conference on Logics in Artificial Intelligence, JELIA 2023, Proceedings, 2023.","mla":"Hannula, Miika, et al. “Logics with Probabilistic Team Semantics and the Boolean Negation.” <i>18th European Conference on Logics in Artificial Intelligence, JELIA 2023, Proceedings</i>, 2023.","bibtex":"@inproceedings{Hannula_Hirvonen_Kontinen_Mahmood_Meier_Virtema_2023, title={Logics with probabilistic team semantics and the Boolean negation}, booktitle={18th European Conference on Logics in Artificial Intelligence, JELIA 2023, Proceedings}, author={Hannula, Miika and Hirvonen, Minna and Kontinen, Juha and Mahmood, Yasir and Meier, Arne and Virtema, Jonni}, year={2023} }","apa":"Hannula, M., Hirvonen, M., Kontinen, J., Mahmood, Y., Meier, A., &#38; Virtema, J. (2023). Logics with probabilistic team semantics and the Boolean negation. <i>18th European Conference on Logics in Artificial Intelligence, JELIA 2023, Proceedings</i>."},"year":"2023","date_created":"2024-05-08T13:20:55Z","author":[{"first_name":"Miika","full_name":"Hannula, Miika","last_name":"Hannula"},{"full_name":"Hirvonen, Minna","last_name":"Hirvonen","first_name":"Minna"},{"full_name":"Kontinen, Juha","last_name":"Kontinen","first_name":"Juha"},{"full_name":"Mahmood, Yasir","id":"99353","last_name":"Mahmood","first_name":"Yasir"},{"first_name":"Arne","full_name":"Meier, Arne","last_name":"Meier"},{"first_name":"Jonni","full_name":"Virtema, Jonni","last_name":"Virtema"}],"date_updated":"2024-06-04T15:52:09Z","title":"Logics with probabilistic team semantics and the Boolean negation","type":"conference","publication":"18th European Conference on Logics in Artificial Intelligence, JELIA 2023, Proceedings","status":"public","user_id":"99353","department":[{"_id":"574"}],"_id":"54089","language":[{"iso":"eng"}],"keyword":["dice enexa mahmood"]}]