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, Juha, et al. “A Parameterized View on the Complexity of Dependence and Independence Logic.” Journal of Logic and Computation, vol. 32, no. 8, Oxford University Press (OUP), 2022, pp. 1624–44, doi:10.1093/logcom/exac070.
LibreCat
| DOI
2022 | Conference Paper | LibreCat-ID: 45846
Kontinen, Juha, et al. “A Parameterized View on the Complexity of Dependence Logic.” 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, Johannes, et al. “Decomposition-Guided Reductions for Argumentation and Treewidth.” 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, Yasir, et al. “Parameterized Complexity of Logic-Based Argumentation in Schaefer’s Framework.” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 35, no. 7, Association for the Advancement of Artificial Intelligence (AAAI), 2021, pp. 6426–34, doi:10.1609/aaai.v35i7.16797.
LibreCat
| DOI
2020 | Conference Paper | LibreCat-ID: 45848
Mahmood, Yasir, and Arne Meier. “Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic.” 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, Yasir, et al. “Parameterised Complexity of Abduction in Schaefer’s Framework.” Logical Foundations of Computer Science, Springer International Publishing, 2020, doi:10.1007/978-3-030-36755-8_13.
LibreCat
| DOI