Yasir Mahmood

Data Science / Heinz Nixdorf Institut
yasir.mahmood@uni-paderborn.de
ID
99353

17 Publications

Mark all

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

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed

17 Publications

Mark all

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

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed