On the Complexity of Preferred Semantics in Argumentation Frameworks with Bounded Cycle Length

Argumentation frameworks are a core formalism in the field of formal argumentation, with several semantics being proposed in the literature. Among them, preferred semantics is one of the most popular but comes with relatively high complexity. In fact, deciding whether an argument is skeptically accepted, i.e. contained in each preferred extension, is Pi^P_2-complete. In this work we study the complexity of this problem w.r.t. the length of the cycles in the considered AF. Our results show which bounds are necessary to decrease the complexity to coNP and P, respectively. We also consider argumentation frameworks with collective attacks and achieve Pi^P_2-hardness already for cycles of length 4.

[1]  Giorgos Flouris,et al.  A comprehensive study of argumentation frameworks with sets of attacking arguments , 2019, Int. J. Approx. Reason..

[2]  Stefan Woltran,et al.  Towards fixed-parameter tractable algorithms for abstract argumentation , 2012, Artif. Intell..

[3]  Simon Parsons,et al.  A Generalization of Dung's Abstract Framework for Argumentation: Arguing with Sets of Attacking Arguments , 2006, ArgMAS.

[4]  Stefan Woltran,et al.  Complexity-sensitive decision procedures for abstract argumentation , 2012, Artif. Intell..

[5]  Wolfgang Dvorák,et al.  Computational Problems in Formal Argumentation and their Complexity , 2017, FLAP.

[6]  Tjitze Rienstra,et al.  A Principle-Based Analysis of Weakly Admissible Semantics , 2020, COMMA.

[7]  Dov M. Gabbay,et al.  Introduction to the special issue on Loops in Argumentation , 2016, J. Log. Comput..

[8]  Ringo Baumann,et al.  Revisiting the Foundations of Abstract Argumentation - Semantics Based on Weak Admissibility and Weak Defense , 2020, AAAI.

[9]  Phan Minh Dung,et al.  On the Acceptability of Arguments and its Fundamental Role in Nonmonotonic Reasoning, Logic Programming and n-Person Games , 1995, Artif. Intell..

[10]  Stefan Woltran,et al.  Graph-Classes of Argumentation Frameworks with Collective Attacks , 2021, JELIA.

[11]  Pietro Baroni,et al.  An introduction to argumentation semantics , 2011, The Knowledge Engineering Review.

[12]  Stefan Woltran,et al.  Evaluating SETAFs via Answer-Set Programming , 2018, SAFA@COMMA.

[13]  Trevor J. M. Bench-Capon,et al.  Complexity and Combinatorial Properties of Argument Systems , 2001 .

[14]  Trevor J. M. Bench-Capon,et al.  Coherence in finite argument systems , 2002, Artif. Intell..