.png){kind=icon}
.png){kind=icon}
Return
Incremental Skeptical Preferred Acceptance in Dynamic Argumentation Frameworks
.png){kind=icon}
PRE
AI
DOI：10.1109/MIS.2021.3050521.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this article, we tackle the problem of efficiently recomputing the skeptical acceptance of dynamic argumentation frameworks under the well-known preferred semantics. We discuss an incremental algorithmic solution whose main idea is that of exploiting the initial knowledge (including the update to perform) in order to identify a potentially small portion of the argumentation framework. Such a portion is sufficient to compute the skeptical preferred acceptance of a goal argument w.r.t. the whole updated framework. We also discuss on how similar ideas extend to more general argumentation frameworks.
Keywords:
RECURSIVE ATTACK
SUPPORT
ACCEPTABILITY
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.