Answer-set programming encodings for argumentation frameworks
Answer-set programming encodings for argumentation frameworks
复制标题
论证框架的答案集编程编码
DOI：
--
复制
发表时间：
2010
期刊：
影响因子：
--
通讯作者：
S. Woltran
中科院分区：
文献类型：
--
作者：
Uwe Egly;S. A. Gaggl;S. Woltran
答案集编程（ASP）已经作为一种声明性编程范例出现，其中问题被编码为逻辑程序，使得这些程序的所谓答案集代表了编码问题的解决方案。最新 ASP 求解器的效率达到了适合解决具有实际意义的问题的水平。因此，许多不同领域的问题，包括诊断、数据集成和图论，都已通过 ASP 成功解决。在这项工作中，我们针对与抽象论证框架（AF）及其概括相关的问题提出了这样的 ASP 编码。我们的编码被制定为固定查询，这样输入是唯一依赖于实际 AF 进行处理的部分。我们详细说明了这种方法的功能，该方法是名为 ASPARTIX 的新论证系统的基础，并展示了其在计算复杂性方面的充分性。
Answer-set programming (ASP) has emerged as a declarative programming paradigm where problems are encoded as logic programs, such that the so-called answer sets of theses programs represent the solutions of the encoded problem. The efficiency of the latest ASP solvers reached a state that makes them applicable for problems of practical importance. Consequently, problems from many different areas, including diagnosis, data integration, and graph theory, have been successfully tackled via ASP. In this work, we present such ASP-encodings for problems associated to abstract argumentation frameworks (AFs) and generalisations thereof. Our encodings are formulated as fixed queries, such that the input is the only part depending on the actual AF to process. We illustrate the functioning of this approach, which is underlying a new argumentation system called ASPARTIX in detail and show its adequacy in terms of computational complexity.