The study of arguments as abstract entities and their interaction as introduced by Dung (Artificial Intelligence 177, 1995) has become one of the most active research branches within Artificial Intelligence and Reasoning. A main issue for abstract argumentation systems is the selection of acceptable sets of arguments. Value-based argumentation, as introduced by Bench-Capon (J. Logic Comput. 13, 2003), extends Dung's framework. It takes into account the relative strength of arguments with respect to some ranking representing an audience: an argument is subjectively accepted if it is accepted with respect to some audience, it is objectively accepted if it is accepted with respect to all audiences. Deciding whether an argument is subjectively or objectively accepted, respectively, are computationally intractable problems. In fact, the problems remain intractable under structural restrictions that render the main computational problems for non-value-based argumentation systems tractable. In this paper we identify nontrivial classes of value-based argumentation systems for which the acceptance problems are polynomial-time tractable. The classes are defined by means of structural restrictions in terms of the underlying graphical structure of the value-based system. Furthermore we show that the acceptance problems are intractable for two classes of value-based systems that where conjectured to be tractable by Dunne (Artificial Intelligence 171, 2007).
The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation
LAMSADE, CNRS, Paris, France（法国国家科学研究中心LAMSADE实验室）；Department of Theoretical Computer Science, Masaryk University, Brno, Czech Republic（马萨里克大学理论计算机科学系）；Institute of Information Systems, Vienna University of Technology, Vienna, Austria（维也纳工业大学信息系统研究所）
On the Complexity of the Grounded Semantics for Infinite Argumentation Frameworks
Department of Mathematics University of Wisconsin-Madison（威斯康星大学麦迪逊分校数学系）；Dipartimento di Ricerca e Innovazione Umanistica University of Bari, Italy（巴里大学人文研究与创新系）
Complexity in finitary argumentation (extended version)
Department of Mathematics, University of Wisconsin-Madison（威斯康星大学麦迪逊分校数学系）；Department of Humanistic Research and Innovation, University of Bari（巴里大学人文研究与创新系）
Facets in Argumentation: A Formal Approach to Argument Significance
Department of Computer and Information Science, Linköping University, Sweden（林雪平大学计算机与信息科学系）；Leibniz Universität Hannover, Germany（汉诺威莱布尼茨大学）；Univ. Artois, CNRS, France（阿诺伊大学）；CSAIL, Massachusetts Institute of Technology, USA（麻省理工学院计算机科学与人工智能实验室）；DICE group, Paderborn University, Germany（波德生大学DICE小组）
Relevance for Stability of Verification Status of a Set of Arguments in Incomplete Argumentation Frameworks (with Proofs)
State Key Laboratory of Mathematical Sciences, Academy of Mathematics and Systems Science, Chinese Academy of Sciences（数学科学国家重点实验室，数学与系统科学研究院，中国科学院）；University of Chinese Academy of Sciences（中国科学院大学）
Department of Computer and Information Science (IDA), Linköping University, Sweden（链接öping大学计算机与信息科学系（IDA））；University of Potsdam, Germany & University of Artois, CNRS, UMR8188 (CRIL), France（波茨坦大学 & 阿尔托伊斯大学、法国CNRS UMR8188（CRIL））；Data Science Group, Heinz Nixdorf Institute, Paderborn University, Germany（帕德博恩大学数据科学小组、海因茨·尼克斯多夫研究所）
Parameterized Argumentation-based Reasoning Tasks for Benchmarking Generative Language Models
Bernoulli Institute of Mathematics, Computer Science and Artificial Intelligence, University of Groningen（伯努利数学、计算机科学和人工智能研究所，格罗宁根大学）；Department of Information and Computing Sciences, Utrecht University（信息与计算科学系，乌得勒支大学）
ArgRE: Formal Argumentation for Conflict Resolution in Multi-Agent Requirements Negotiation
Department of Computer Science and Communications Engineering, Waseda University（早稻田大学计算机科学与通信工程系）；College of Architecture and Urban Planning, Tongji University（同济大学建筑与城市规划学院）；Advanced Institute of So-Go-Chi (Convergence Knowledge) Informatics, Tohoku University（东北大学So-Go-Chi（融合知识）信息学高级研究所）；Aisin Corporation（日产公司）
