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 Δ can be translated into a logic program PΔ so that the extensions prescribed by different semantics of Δ coincide with subsets of the PSMs of PΔ. 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.

中文翻译：

---

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

最近，人们对扩展 Dung 的抽象论证框架 (AF) 的框架越来越感兴趣。流行的扩展包括双极 AF 和具有递归攻击和必要支持的 AF。尽管已经深入研究了 AF 语义和逻辑程序的部分稳定模型 (PSM) 之间的关系，但对于扩展 AF 的更一般的框架来说，情况并非如此。在本文中，我们探讨了基于 AF 的框架和 PSM 之间的关系。我们证明了每个基于 AF 的框架 Δ 都可以翻译成一个逻辑程序磷Δ使得 Δ 的不同语义所规定的扩展与 Δ 的 PSM 的子集一致磷Δ. 我们提供了一种逻辑编程方法，它以优雅和统一的方式描述了几个基于 AF 的框架的语义。该结果还允许为基于 AF 的新框架定义语义，例如具有递归攻击和递归演绎支持的 AF。