17 Publications

Mark all

[17]
2024 | Book Chapter | LibreCat-ID: 54580
Mahmood, Y., Virtema, J., Barlag, T., & Ngonga Ngomo, A.-C. (2024). Computing Repairs Under Functional and Inclusion Dependencies via Argumentation. In Lecture Notes in Computer Science. Springer Nature Switzerland. https://doi.org/10.1007/978-3-031-56940-1_2
LibreCat | DOI
 
[16]
2024 | Conference Paper | LibreCat-ID: 55655
Hecher, M., Mahmood, Y., Meier, A., & Schmidt, J. (2024). Quantitative Claim-Centric Reasoning in Logic-Based Argumentation. Proceedings of the Thirty-ThirdInternational Joint Conference on Artificial Intelligence. https://doi.org/10.24963/ijcai.2024/377
LibreCat | DOI
 
[15]
2024 | Journal Article | LibreCat-ID: 54092
Kontinen, J., Mahmood, Y., Meier, A., & Vollmer, H. (2024). Parameterized Complexity of Weighted Team Definability. Mathematical Structures in Computer Science, 1–15. https://doi.org/10.1017/S0960129524000033
LibreCat | DOI
 
[14]
2024 | Preprint | LibreCat-ID: 58377
Mahmood, Y., Hecher, M., & Ngonga Ngomo, A.-C. (2024). Dung’s Argumentation Framework: Unveiling the Expressive Power with  Inconsistent Databases. In arXiv:2412.11617.
LibreCat | arXiv
 
[13]
2024 | Book Chapter | LibreCat-ID: 57238
Fichte, J. K., Hecher, M., Mahmood, Y., & Meier, A. (2024). Rejection in Abstract Argumentation: Harder Than Acceptance? In Frontiers in Artificial Intelligence and Applications. ECAI} 2024 - 27th European Conference on Artificial Intelligence, Santiago de Compostela, Spain. IOS Press. https://doi.org/10.3233/faia240867
LibreCat | DOI
 
[12]
2024 | Preprint | LibreCat-ID: 57814
Hankala, T., Hannula, M., Mahmood, Y., & Meier, A. (2024). Parameterised Complexity of Consistent Query Answering via Graph  Representations. In arXiv:2412.08324.
LibreCat | arXiv
 
[11]
2023 | Journal Article | LibreCat-ID: 54577
Mahmood, Y., Meier, A., & Schmidt, J. (2023). Parameterized Complexity of Logic-based Argumentation in Schaefer’s Framework. ACM Transactions on Computational Logic, 24(3), 1–25. https://doi.org/10.1145/3582499
LibreCat | DOI
 
[10]
2023 | Conference Paper | LibreCat-ID: 54578
Fichte, J. K., Hecher, M., Mahmood, Y., & Meier, A. (2023). Quantitative Reasoning and Structural Complexity for Claim-Centric Argumentation. Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence. https://doi.org/10.24963/ijcai.2023/358
LibreCat | DOI
 
[9]
2023 | Book Chapter | LibreCat-ID: 54579
Mahmood, Y., & Virtema, J. (2023). Parameterized Complexity of Propositional Inclusion and Independence Logic. In Logic, Language, Information, and Computation. Springer Nature Switzerland. https://doi.org/10.1007/978-3-031-39784-4_17
LibreCat | DOI
 
[8]
2023 | Conference Paper | LibreCat-ID: 54089
Hannula, M., Hirvonen, M., Kontinen, J., Mahmood, Y., Meier, A., & Virtema, J. (2023). Logics with probabilistic team semantics and the Boolean negation. 18th European Conference on Logics in Artificial Intelligence, JELIA 2023, Proceedings.
LibreCat
 
[7]
2022 | Journal Article | LibreCat-ID: 45849
Mahmood, Y., & Meier, A. (2022). Parameterised complexity of model checking and satisfiability in propositional dependence logic. Annals of Mathematics and Artificial Intelligence, 90(2–3), 271–296. https://doi.org/10.1007/s10472-021-09730-w
LibreCat | DOI
 
[6]
2022 | Journal Article | LibreCat-ID: 45847
Kontinen, J., Meier, A., & Mahmood, Y. (2022). A parameterized view on the complexity of dependence and independence logic. Journal of Logic and Computation, 32(8), 1624–1644. https://doi.org/10.1093/logcom/exac070
LibreCat | DOI
 
[5]
2022 | Conference Paper | LibreCat-ID: 45846
Kontinen, J., Meier, A., & Mahmood, Y. (2022). A Parameterized View on the Complexity of Dependence Logic. Logical Foundations of Computer Science. https://doi.org/10.1007/978-3-030-93100-1_9
LibreCat | DOI
 
[4]
2021 | Conference Paper | LibreCat-ID: 45840
Fichte, J., Hecher, M., Mahmood, Y., & Meier, A. (2021). Decomposition-Guided Reductions for Argumentation and Treewidth. Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence. https://doi.org/10.24963/ijcai.2021/259
LibreCat | DOI
 
[3]
2021 | Conference Paper | LibreCat-ID: 45841
Mahmood, Y., Meier, A., & Schmidt, J. (2021). Parameterized Complexity of Logic-Based Argumentation in Schaefer’s Framework. Proceedings of the AAAI Conference on Artificial Intelligence, 35(7), 6426–6434. https://doi.org/10.1609/aaai.v35i7.16797
LibreCat | DOI
 
[2]
2020 | Conference Paper | LibreCat-ID: 45848
Mahmood, Y., & Meier, A. (2020). Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-030-39951-1_10
LibreCat | DOI
 
[1]
2020 | Conference Paper | LibreCat-ID: 45818
Mahmood, Y., Meier, A., & Schmidt, J. (2020). Parameterised Complexity of Abduction in Schaefer’s Framework. Logical Foundations of Computer Science. https://doi.org/10.1007/978-3-030-36755-8_13
LibreCat | DOI
 

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed

17 Publications

Mark all

[17]
2024 | Book Chapter | LibreCat-ID: 54580
Mahmood, Y., Virtema, J., Barlag, T., & Ngonga Ngomo, A.-C. (2024). Computing Repairs Under Functional and Inclusion Dependencies via Argumentation. In Lecture Notes in Computer Science. Springer Nature Switzerland. https://doi.org/10.1007/978-3-031-56940-1_2
LibreCat | DOI
 
[16]
2024 | Conference Paper | LibreCat-ID: 55655
Hecher, M., Mahmood, Y., Meier, A., & Schmidt, J. (2024). Quantitative Claim-Centric Reasoning in Logic-Based Argumentation. Proceedings of the Thirty-ThirdInternational Joint Conference on Artificial Intelligence. https://doi.org/10.24963/ijcai.2024/377
LibreCat | DOI
 
[15]
2024 | Journal Article | LibreCat-ID: 54092
Kontinen, J., Mahmood, Y., Meier, A., & Vollmer, H. (2024). Parameterized Complexity of Weighted Team Definability. Mathematical Structures in Computer Science, 1–15. https://doi.org/10.1017/S0960129524000033
LibreCat | DOI
 
[14]
2024 | Preprint | LibreCat-ID: 58377
Mahmood, Y., Hecher, M., & Ngonga Ngomo, A.-C. (2024). Dung’s Argumentation Framework: Unveiling the Expressive Power with  Inconsistent Databases. In arXiv:2412.11617.
LibreCat | arXiv
 
[13]
2024 | Book Chapter | LibreCat-ID: 57238
Fichte, J. K., Hecher, M., Mahmood, Y., & Meier, A. (2024). Rejection in Abstract Argumentation: Harder Than Acceptance? In Frontiers in Artificial Intelligence and Applications. ECAI} 2024 - 27th European Conference on Artificial Intelligence, Santiago de Compostela, Spain. IOS Press. https://doi.org/10.3233/faia240867
LibreCat | DOI
 
[12]
2024 | Preprint | LibreCat-ID: 57814
Hankala, T., Hannula, M., Mahmood, Y., & Meier, A. (2024). Parameterised Complexity of Consistent Query Answering via Graph  Representations. In arXiv:2412.08324.
LibreCat | arXiv
 
[11]
2023 | Journal Article | LibreCat-ID: 54577
Mahmood, Y., Meier, A., & Schmidt, J. (2023). Parameterized Complexity of Logic-based Argumentation in Schaefer’s Framework. ACM Transactions on Computational Logic, 24(3), 1–25. https://doi.org/10.1145/3582499
LibreCat | DOI
 
[10]
2023 | Conference Paper | LibreCat-ID: 54578
Fichte, J. K., Hecher, M., Mahmood, Y., & Meier, A. (2023). Quantitative Reasoning and Structural Complexity for Claim-Centric Argumentation. Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence. https://doi.org/10.24963/ijcai.2023/358
LibreCat | DOI
 
[9]
2023 | Book Chapter | LibreCat-ID: 54579
Mahmood, Y., & Virtema, J. (2023). Parameterized Complexity of Propositional Inclusion and Independence Logic. In Logic, Language, Information, and Computation. Springer Nature Switzerland. https://doi.org/10.1007/978-3-031-39784-4_17
LibreCat | DOI
 
[8]
2023 | Conference Paper | LibreCat-ID: 54089
Hannula, M., Hirvonen, M., Kontinen, J., Mahmood, Y., Meier, A., & Virtema, J. (2023). Logics with probabilistic team semantics and the Boolean negation. 18th European Conference on Logics in Artificial Intelligence, JELIA 2023, Proceedings.
LibreCat
 
[7]
2022 | Journal Article | LibreCat-ID: 45849
Mahmood, Y., & Meier, A. (2022). Parameterised complexity of model checking and satisfiability in propositional dependence logic. Annals of Mathematics and Artificial Intelligence, 90(2–3), 271–296. https://doi.org/10.1007/s10472-021-09730-w
LibreCat | DOI
 
[6]
2022 | Journal Article | LibreCat-ID: 45847
Kontinen, J., Meier, A., & Mahmood, Y. (2022). A parameterized view on the complexity of dependence and independence logic. Journal of Logic and Computation, 32(8), 1624–1644. https://doi.org/10.1093/logcom/exac070
LibreCat | DOI
 
[5]
2022 | Conference Paper | LibreCat-ID: 45846
Kontinen, J., Meier, A., & Mahmood, Y. (2022). A Parameterized View on the Complexity of Dependence Logic. Logical Foundations of Computer Science. https://doi.org/10.1007/978-3-030-93100-1_9
LibreCat | DOI
 
[4]
2021 | Conference Paper | LibreCat-ID: 45840
Fichte, J., Hecher, M., Mahmood, Y., & Meier, A. (2021). Decomposition-Guided Reductions for Argumentation and Treewidth. Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence. https://doi.org/10.24963/ijcai.2021/259
LibreCat | DOI
 
[3]
2021 | Conference Paper | LibreCat-ID: 45841
Mahmood, Y., Meier, A., & Schmidt, J. (2021). Parameterized Complexity of Logic-Based Argumentation in Schaefer’s Framework. Proceedings of the AAAI Conference on Artificial Intelligence, 35(7), 6426–6434. https://doi.org/10.1609/aaai.v35i7.16797
LibreCat | DOI
 
[2]
2020 | Conference Paper | LibreCat-ID: 45848
Mahmood, Y., & Meier, A. (2020). Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-030-39951-1_10
LibreCat | DOI
 
[1]
2020 | Conference Paper | LibreCat-ID: 45818
Mahmood, Y., Meier, A., & Schmidt, J. (2020). Parameterised Complexity of Abduction in Schaefer’s Framework. Logical Foundations of Computer Science. https://doi.org/10.1007/978-3-030-36755-8_13
LibreCat | DOI
 

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed