首页|Algorithms for computing the set of acceptable arguments
Algorithms for computing the set of acceptable arguments
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NETL
NSTL
Elsevier
We investigate the computational problem of determining the set of acceptable arguments in abstract argumentation wrt. credulous and skeptical reasoning under grounded, complete, stable, and preferred semantics. In particular, we investigate the computational complexity of that problem and its verification variant, and develop several algorithms for all problem variants, including two baseline approaches based on iterative acceptability queries and extension enumeration, and some optimised versions. We experimentally compare the runtime performance of these algorithms: our results show that our newly optimised algorithms significantly outperform the baseline algorithms in most cases.
NETL
NSTL
Elsevier
