Parameterized Complexity of Logic-based Argumentation in Schaefer’s Framework

Y. Mahmood, A. Meier, J. Schmidt, ACM Transactions on Computational Logic 24 (2023) 1–25.

Download
No fulltext has been uploaded.
Journal Article | Published | English
Author
Mahmood, YasirLibreCat; Meier, Arne; Schmidt, Johannes
Department
Abstract
<jats:p>Argumentation is a well-established formalism dealing with conflicting information by generating and comparing arguments. It has been playing a major role in AI for decades. In logic-based argumentation, we explore the internal structure of an argument. 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 article, 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 (Creignou et al. 2014 and Parson et al., 2003) 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 (STOC 1978) and then study different parameterizations for each of the fragments. We 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 (para-NP and beyond).</jats:p>
Publishing Year
Journal Title
ACM Transactions on Computational Logic
Volume
24
Issue
3
Page
1-25
LibreCat-ID

Cite this

Mahmood Y, Meier A, Schmidt J. Parameterized Complexity of Logic-based Argumentation in Schaefer’s Framework. ACM Transactions on Computational Logic. 2023;24(3):1-25. doi:10.1145/3582499
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
@article{Mahmood_Meier_Schmidt_2023, title={Parameterized Complexity of Logic-based Argumentation in Schaefer’s Framework}, volume={24}, DOI={10.1145/3582499}, number={3}, journal={ACM Transactions on Computational Logic}, publisher={Association for Computing Machinery (ACM)}, author={Mahmood, Yasir and Meier, Arne and Schmidt, Johannes}, year={2023}, pages={1–25} }
Mahmood, Yasir, Arne Meier, and Johannes Schmidt. “Parameterized Complexity of Logic-Based Argumentation in Schaefer’s Framework.” ACM Transactions on Computational Logic 24, no. 3 (2023): 1–25. https://doi.org/10.1145/3582499.
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.
Mahmood, Yasir, et al. “Parameterized Complexity of Logic-Based Argumentation in Schaefer’s Framework.” ACM Transactions on Computational Logic, vol. 24, no. 3, Association for Computing Machinery (ACM), 2023, pp. 1–25, doi:10.1145/3582499.

Export

Marked Publications

Open Data LibreCat

Search this title in

Google Scholar