Powerful formalisms for abstract argumentation have been proposed, among them abstract dialectical frameworks (ADFs) that allow for a succinct and flexible specification of the relationship between arguments and the GRAPPA framework which allows argumentation scenarios to be represented as arbitrary edge-labeled graphs. The complexity of ADFs and GRAPPA is located beyond NP and ranges up to the third level of the polynomial hierarchy. The combined complexity of Answer Set Programming (ASP) exactly matches this complexity when programs are restricted to predicates of bounded arity. In this paper, we exploit this coincidence and present novel efficient translations from ADFs and GRAPPA to ASP. More specifically, we provide reductions for the five main ADF semantics of admissible, complete, preferred, grounded, and stable interpretations, and exemplify how these reductions need to be adapted for GRAPPA for the admissible, complete, and preferred semantics.

中文翻译：

---

使用答案集编程解决高级论证问题

已经提出了用于抽象论证的强大形式，其中包括抽象辩证框架 (ADF)，它允许对论证之间的关系进行简洁灵活的规范，而 GRAPPA 框架允许将论证场景表示为任意边缘标记的图。ADF 和 GRAPPA 的复杂性超出了 NP，范围高达多项式层次结构的第三级。当程序仅限于有界数量的谓词时，答案集编程 (ASP) 的组合复杂性与这种复杂性完全匹配。在本文中，我们利用这种巧合，提出了从 ADF 和 GRAPPA 到 ASP 的新颖高效的翻译。更具体地说，我们为可接受、完整、首选、扎根和稳定解释的五个主要 ADF 语义提供了简化，