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.
26 Publications
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
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
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
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
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
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