Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
17 Publications
2024 | Book Chapter | LibreCat-ID: 54580
Mahmood Y, Virtema J, Barlag T, Ngonga Ngomo A-C. Computing Repairs Under Functional and Inclusion Dependencies via Argumentation. In: Lecture Notes in Computer Science. Springer Nature Switzerland; 2024. doi:10.1007/978-3-031-56940-1_2
LibreCat
| DOI
2024 | Conference Paper | LibreCat-ID: 55655
Hecher M, Mahmood Y, Meier A, Schmidt J. Quantitative Claim-Centric Reasoning in Logic-Based Argumentation. In: Proceedings of the Thirty-ThirdInternational Joint Conference on Artificial Intelligence. International Joint Conferences on Artificial Intelligence Organization; 2024. doi:10.24963/ijcai.2024/377
LibreCat
| DOI
2024 | Journal Article | LibreCat-ID: 54092
Kontinen J, Mahmood Y, Meier A, Vollmer H. Parameterized Complexity of Weighted Team Definability. Mathematical Structures in Computer Science. Published online 2024:1-15. doi:10.1017/S0960129524000033
LibreCat
| DOI
2024 | Book Chapter | LibreCat-ID: 57238
Fichte JK, Hecher M, Mahmood Y, Meier A. Rejection in Abstract Argumentation: Harder Than Acceptance? In: Frontiers in Artificial Intelligence and Applications. IOS Press; 2024. doi:10.3233/faia240867
LibreCat
| DOI
2023 | Journal Article | LibreCat-ID: 54577
Mahmood Y, Meier A, Schmidt J. Parameterized Complexity of Logic-based Argumentation in Schaefer’s Framework. ACM Transactions on Computational Logic. 2023;24(3):1-25. doi:10.1145/3582499
LibreCat
| DOI
2023 | Conference Paper | LibreCat-ID: 54578
Fichte JK, Hecher M, Mahmood Y, Meier A. Quantitative Reasoning and Structural Complexity for Claim-Centric Argumentation. In: Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence. International Joint Conferences on Artificial Intelligence Organization; 2023. doi:10.24963/ijcai.2023/358
LibreCat
| DOI
2023 | Book Chapter | LibreCat-ID: 54579
Mahmood Y, Virtema J. Parameterized Complexity of Propositional Inclusion and Independence Logic. In: Logic, Language, Information, and Computation. Springer Nature Switzerland; 2023. doi:10.1007/978-3-031-39784-4_17
LibreCat
| DOI
2023 | Conference Paper | LibreCat-ID: 54089
Hannula M, Hirvonen M, Kontinen J, Mahmood Y, Meier A, Virtema J. Logics with probabilistic team semantics and the Boolean negation. In: 18th European Conference on Logics in Artificial Intelligence, JELIA 2023, Proceedings. ; 2023.
LibreCat
2022 | Journal Article | LibreCat-ID: 45849
Mahmood Y, Meier A. Parameterised complexity of model checking and satisfiability in propositional dependence logic. Annals of Mathematics and Artificial Intelligence. 2022;90(2-3):271-296. doi:10.1007/s10472-021-09730-w
LibreCat
| DOI
2022 | Journal Article | LibreCat-ID: 45847
Kontinen J, Meier A, Mahmood Y. A parameterized view on the complexity of dependence and independence logic. Journal of Logic and Computation. 2022;32(8):1624-1644. doi:10.1093/logcom/exac070
LibreCat
| DOI
2022 | Conference Paper | LibreCat-ID: 45846
Kontinen J, Meier A, Mahmood Y. A Parameterized View on the Complexity of Dependence Logic. In: Logical Foundations of Computer Science. Springer International Publishing; 2022. doi:10.1007/978-3-030-93100-1_9
LibreCat
| DOI
2021 | Conference Paper | LibreCat-ID: 45840
Fichte J, Hecher M, Mahmood Y, Meier A. Decomposition-Guided Reductions for Argumentation and Treewidth. In: Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence. International Joint Conferences on Artificial Intelligence Organization; 2021. doi:10.24963/ijcai.2021/259
LibreCat
| DOI
2021 | Conference Paper | LibreCat-ID: 45841
Mahmood Y, Meier A, Schmidt J. Parameterized Complexity of Logic-Based Argumentation in Schaefer’s Framework. In: Proceedings of the AAAI Conference on Artificial Intelligence. Vol 35. Association for the Advancement of Artificial Intelligence (AAAI); 2021:6426-6434. doi:10.1609/aaai.v35i7.16797
LibreCat
| DOI
2020 | Conference Paper | LibreCat-ID: 45848
Mahmood Y, Meier A. Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic. In: Lecture Notes in Computer Science. Springer International Publishing; 2020. doi:10.1007/978-3-030-39951-1_10
LibreCat
| DOI
2020 | Conference Paper | LibreCat-ID: 45818
Mahmood Y, Meier A, Schmidt J. Parameterised Complexity of Abduction in Schaefer’s Framework. In: Logical Foundations of Computer Science. Springer International Publishing; 2020. doi:10.1007/978-3-030-36755-8_13
LibreCat
| DOI