摘要翻译：
Dung著名的抽象论证框架代表了论证领域中许多问题和应用的核心形式主义，它在过去十年中得到了显著的发展。因此，该领域最近的工作集中在这些框架的实现上，其中一个主要方法是使用答案集编程(ASP)。虽然一些论证语义可以在ASP语言中很好地表达，但其他的需要相当繁琐的编码技术。ASP系统的最新进展，特别是ASP包GRINGO/CLASPD的metasp优化前端提供了直接的命令来过滤满足某些子集最小（或最大）约束的答案集。与标准ASP语言相比，这允许更简单的编码。在本文中，我们实验比较了原始编码（分别基于首选、半稳定和阶段扩展的论证语义）和新的metasp编码。此外，我们为最近引入的基于分辨率的基础语义提供了新的编码。我们的实验结果表明，metasp方法在那些编码问题的复杂性充分反映在metasp方法中的情况下工作得很好。
---
英文标题：
《Making Use of Advances in Answer-Set Programming for Abstract
  Argumentation Systems》
---
作者：
Wolfgang Dvo\v{r}\'ak, Sarah Alice Gaggl, Johannes Wallner, Stefan
  Woltran
---
最新提交年份：
2011
---
分类信息：

一级分类：Computer Science        计算机科学
二级分类：Artificial Intelligence        人工智能
分类描述：Covers all areas of AI except Vision, Robotics, Machine Learning, Multiagent Systems, and Computation and Language (Natural Language Processing), which have separate subject areas. In particular, includes Expert Systems, Theorem Proving (although this may overlap with Logic in Computer Science), Knowledge Representation, Planning, and Uncertainty in AI. Roughly includes material in ACM Subject Classes I.2.0, I.2.1, I.2.3, I.2.4, I.2.8, and I.2.11.
涵盖了人工智能的所有领域，除了视觉、机器人、机器学习、多智能体系统以及计算和语言（自然语言处理），这些领域有独立的学科领域。特别地，包括专家系统，定理证明（尽管这可能与计算机科学中的逻辑重叠），知识表示，规划，和人工智能中的不确定性。大致包括ACM学科类I.2.0、I.2.1、I.2.3、I.2.4、I.2.8和I.2.11中的材料。
--

---
英文摘要：
  Dung's famous abstract argumentation frameworks represent the core formalism for many problems and applications in the field of argumentation which significantly evolved within the last decade. Recent work in the field has thus focused on implementations for these frameworks, whereby one of the main approaches is to use Answer-Set Programming (ASP). While some of the argumentation semantics can be nicely expressed within the ASP language, others required rather cumbersome encoding techniques. Recent advances in ASP systems, in particular, the metasp optimization frontend for the ASP-package gringo/claspD provides direct commands to filter answer sets satisfying certain subset-minimality (or -maximality) constraints. This allows for much simpler encodings compared to the ones in standard ASP language. In this paper, we experimentally compare the original encodings (for the argumentation semantics based on preferred, semi-stable, and respectively, stage extensions) with new metasp encodings. Moreover, we provide novel encodings for the recently introduced resolution-based grounded semantics. Our experimental results indicate that the metasp approach works well in those cases where the complexity of the encoded problem is adequately mirrored within the metasp approach.
---
PDF链接：
https://arxiv.org/pdf/1108.4942