Computing Preferred Extensions in Abstract Argumentation: A SAT-Based Approach
Computing Preferred Extensions in Abstract Argumentation: A SAT-Based Approach
复制标题
计算抽象论证中的首选扩展：基于 SAT 的方法
DOI：
--
复制
发表时间：
2013
期刊：
影响因子：
--
通讯作者：
M. Vallati
中科院分区：
文献类型：
--
作者：
F. Cerutti;P. Dunne;M. Giacomin;M. Vallati
本文提出了一种新的SAT为基础的方法，在抽象论证的扩展计算，侧重于首选语义，其性能的实证评估。该方法是基于减少的思想计算完整的扩展到SAT问题的问题，然后使用深度优先搜索方法来获得首选的扩展。所提出的方法已经过测试，使用两个不同的SAT求解器，并与三个国家的最先进的系统进行比较，首选的扩展计算。事实证明，所提出的方法提供了显着更好的性能，在大多数情况下考虑。
This paper presents a novel SAT-based approach for the computation of extensions in abstract argumentation, with focus on preferred semantics, and an empirical evaluation of its performances. The approach is based on the idea of reducing the problem of computing complete extensions to a SAT problem and then using a depth-first search method to derive preferred extensions. The proposed approach has been tested using two distinct SAT solvers and compared with three state-of-the-art systems for preferred extension computation. It turns out that the proposed approach delivers significantly better performances in the large majority of the considered cases.