.png){kind=icon}
.png){kind=icon}
Return
Algorithms for decision problems in argument systems under preferred semantics
.png){kind=icon}
OA
AI
DOI：10.1016/j.artint.2013.11.001.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
For Dung's model of abstract argumentation under preferred semantics, argumentation frameworks may have several distinct preferred extensions: i.e., in informal terms, sets of acceptable arguments. Thus the acceptance problem (for a specific argument) can consider deciding whether an argument is in at least one such extensions (credulously accepted) or in all such extensions (skeptically accepted). We start by presenting a new algorithm that enumerates all preferred extensions. Following this we build algorithms that decide the acceptance problem without requiring explicit enumeration of all extensions. We analyze the performance of our algorithms by comparing these to existing ones, and present experimental evidence that the new algorithms are more efficient with respect to the expected running time. Moreover, we extend our techniques to solve decision problems in a widely studied development of Dung's model: namely value-based argumentation frameworks (VAFS). In this regard, we examine analogous notions to the problem of enumerating preferred extensions and present algorithms that decide subjective, respectively objective, acceptance. (C) 2013 Elsevier B.V. All rights reserved.
Keywords:
Abstract argumentation
Preferred extensions
Algorithms
Skeptical acceptance
Credulous acceptance
Value based argumentation
Subjective acceptance
Objective acceptance
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
13.9
Papers:
6.1K
Citations:
1.9W