On checking skeptical and ideal admissibility in abstract argumentation frameworks

摘要

A Abstract argumentation frameworks (AFs) are directed graphs with vertices being abstract arguments and edges denoting the attacks between them. Within the context of AFS, we implement and evaluate an algorithm for two essential computational problems: checking skeptical and ideal admissibility. We evaluate the implemented algorithms using a widely known benchmark. In terms of the number of solved problem instances and the average running time, our implementation outperforms two prominent systems. (C) 2019 Elsevier B.V. All rights reserved.