Recently there has been an increasing interest in frameworks extending Dung's
abstract Argumentation Framework (AF). Popular extensions include bipolar AFs
and AFs with recursive attacks and necessary supports. Although the
relationships between AF semantics and Partial Stable Models (PSMs) of logic
programs has been deeply investigated, this is not the case for more general
frameworks extending AF.
In this paper we explore the relationships between AF-based frameworks and
PSMs. We show that every AF-based framework $\Delta$ can be translated into a
logic program $P_\Delta$ so that the extensions prescribed by different
semantics of $\Delta$ coincide with subsets of the PSMs of $P_\Delta$. We
provide a logic programming approach that characterizes, in an elegant and
uniform way, the semantics of several AF-based frameworks. This result allows
also to define the semantics for new AF-based frameworks, such as AFs with
recursive attacks and recursive deductive supports.
Under consideration for publication in Theory and Practice of Logic
Programming.

本研究探讨了基于 Argumentation Framework 的框架和 Partial Stable Models 之间的关系，证明每个基于 AF 的框架 Delta 都可以被翻译成一个逻辑程序 P_Delta，而不同的 Delta 语义扩展可以对应于 P_Delta 的不同 PSM 子集。该研究为新的基于 AF 的框架的语义定义提供了可能性，例如带有递归攻击和递归演绎支持的 AFs。

抽象论证框架语义：逻辑编程方法

On the Semantics of Abstract Argumentation Frameworks: A Logic  Programming Approach

The issue of representing attacks to attacks in argumentation is receiving an
increasing attention as a useful conceptual modelling tool in several contexts.
In this paper we present AFRA, a formalism encompassing unlimited recursive
attacks within argumentation frameworks. AFRA satisfies the basic requirements
of definition simplicity and rigorous compatibility with Dung's theory of
argumentation. This paper provides a complete development of the AFRA formalism
complemented by illustrative examples and a detailed comparison with other
recursive attack formalizations.

本文介绍了一种名为 AFRA 的正式要素，它涵盖了论证框架内无限递归攻击的基本要求，并提供了具体的例子和与其他递归攻击形式化的详细比较。