Nofal, Samer, Atkinson, Katie ORCID: 0000-0002-5683-4106 and Dunne, Paul E ORCID: 0000-0002-6033-3742
(2019)
On checking skeptical and ideal admissibility in abstract argumentation frameworks.
INFORMATION PROCESSING LETTERS, 148.
pp. 7-12.
Text
elsarticle-template.pdf - Author Accepted Manuscript Download (263kB) |
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.
Item Type: | Article |
---|---|
Uncontrolled Keywords: | Algorithms, Argumentation graph, Argumentation semantics |
Depositing User: | Symplectic Admin |
Date Deposited: | 09 Apr 2019 15:09 |
Last Modified: | 19 Jan 2023 00:54 |
DOI: | 10.1016/j.ipl.2019.03.013 |
Related URLs: | |
URI: | https://livrepository.liverpool.ac.uk/id/eprint/3036263 |