论文标题
关于抽象论证框架的语义：一种逻辑编程方法
On the Semantics of Abstract Argumentation Frameworks: A Logic Programming Approach
论文作者
论文摘要
最近，人们对扩展粪便的抽象论证框架（AF）的框架越来越兴趣。流行的扩展包括具有递归攻击的双极AFS和AFS和必要的支撑。尽管已经深入研究了逻辑程序的AF语义和部分稳定模型（PSM）之间的关系，但对于扩展AF的更一般框架并非如此。 在本文中，我们探讨了基于AF的框架和PSM之间的关系。我们表明，每个基于AF的框架$δ$都可以转化为逻辑程序$P_δ$，因此，不同语义的$δ$规定的扩展名与$p_Δ$的psms子集合。我们提供了一种逻辑编程方法，该方法以优雅而统一的方式表征了几种基于AF的框架的语义。该结果还允许定义基于新的AF的框架的语义，例如具有递归攻击和递归演绎支持的AFS。 正在考虑逻辑编程理论和实践中出版的内容。
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. Under consideration for publication in Theory and Practice of Logic Programming.
