{"page":"6426-6434","language":[{"iso":"eng"}],"publication":"Proceedings of the AAAI Conference on Artificial Intelligence","status":"public","_id":"45841","user_id":"99353","year":"2022","citation":{"apa":"Mahmood, Y., Meier, A., &#38; Schmidt, J. (2022). Parameterized Complexity of Logic-Based Argumentation in Schaefer’s Framework. <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, <i>35</i>(7), 6426–6434. <a href=\"https://doi.org/10.1609/aaai.v35i7.16797\">https://doi.org/10.1609/aaai.v35i7.16797</a>","mla":"Mahmood, Yasir, et al. “Parameterized Complexity of Logic-Based Argumentation in Schaefer’s Framework.” <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, vol. 35, no. 7, Association for the Advancement of Artificial Intelligence (AAAI), 2022, pp. 6426–34, doi:<a href=\"https://doi.org/10.1609/aaai.v35i7.16797\">10.1609/aaai.v35i7.16797</a>.","chicago":"Mahmood, Yasir, Arne Meier, and Johannes Schmidt. “Parameterized Complexity of Logic-Based Argumentation in Schaefer’s Framework.” In <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, 35:6426–34. Association for the Advancement of Artificial Intelligence (AAAI), 2022. <a href=\"https://doi.org/10.1609/aaai.v35i7.16797\">https://doi.org/10.1609/aaai.v35i7.16797</a>.","bibtex":"@inproceedings{Mahmood_Meier_Schmidt_2022, title={Parameterized Complexity of Logic-Based Argumentation in Schaefer’s Framework}, volume={35}, DOI={<a href=\"https://doi.org/10.1609/aaai.v35i7.16797\">10.1609/aaai.v35i7.16797</a>}, number={7}, booktitle={Proceedings of the AAAI Conference on Artificial Intelligence}, publisher={Association for the Advancement of Artificial Intelligence (AAAI)}, author={Mahmood, Yasir and Meier, Arne and Schmidt, Johannes}, year={2022}, pages={6426–6434} }","ieee":"Y. Mahmood, A. Meier, and J. Schmidt, “Parameterized Complexity of Logic-Based Argumentation in Schaefer’s Framework,” in <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>, 2022, vol. 35, no. 7, pp. 6426–6434, doi: <a href=\"https://doi.org/10.1609/aaai.v35i7.16797\">10.1609/aaai.v35i7.16797</a>.","ama":"Mahmood Y, Meier A, Schmidt J. Parameterized Complexity of Logic-Based Argumentation in Schaefer’s Framework. In: <i>Proceedings of the AAAI Conference on Artificial Intelligence</i>. Vol 35. Association for the Advancement of Artificial Intelligence (AAAI); 2022:6426-6434. doi:<a href=\"https://doi.org/10.1609/aaai.v35i7.16797\">10.1609/aaai.v35i7.16797</a>","short":"Y. Mahmood, A. Meier, J. Schmidt, in: Proceedings of the AAAI Conference on Artificial Intelligence, Association for the Advancement of Artificial Intelligence (AAAI), 2022, pp. 6426–6434."},"keyword":["General Medicine"],"type":"conference","publisher":"Association for the Advancement of Artificial Intelligence (AAAI)","issue":"7","intvolume":"        35","date_updated":"2023-07-03T11:42:35Z","title":"Parameterized Complexity of Logic-Based Argumentation in Schaefer's Framework","abstract":[{"lang":"eng","text":"<jats:p>Logic-based argumentation is a well-established formalism modeling nonmonotonic reasoning. It has been playing a major role in AI for decades, now.  Informally, a set of formulas is the support for a given claim if it is consistent, subset-minimal, and implies the claim. In such a case, the pair of the support and the claim together is called an argument. In this paper, we study the propositional variants of the following three computational tasks studied in argumentation: ARG (exists a support for a given claim with respect to a given set of formulas), ARG-Check (is a given set a support for a given claim), and ARG-Rel (similarly as ARG plus requiring an additionally given formula to be contained in the support). ARG-Check is complete for the complexity class DP, and the other two problems are known to be complete for the second level of the polynomial hierarchy and, accordingly, are highly intractable. Analyzing the reason for this intractability, we perform a two-dimensional classification: first, we consider all possible propositional fragments of the problem within Schaefer's framework, and then study different parameterizations for each of the fragment.\r\nWe identify a list of reasonable structural parameters (size of the claim, support, knowledge-base) that are connected to the aforementioned decision problems. Eventually, we thoroughly draw a fine border of parameterized intractability for each of the problems showing where the problems are fixed-parameter tractable and when this exactly stops. Surprisingly, several cases are of very high intractability (paraNP and beyond).</jats:p>"}],"publication_status":"published","doi":"10.1609/aaai.v35i7.16797","date_created":"2023-07-03T11:34:49Z","publication_identifier":{"issn":["2374-3468","2159-5399"]},"author":[{"last_name":"Mahmood","full_name":"Mahmood, Yasir","first_name":"Yasir"},{"first_name":"Arne","last_name":"Meier","full_name":"Meier, Arne"},{"first_name":"Johannes","last_name":"Schmidt","full_name":"Schmidt, Johannes"}],"volume":35}