A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Efficient Computation of Extensions for Dynamic Abstract Argumentation Frameworks: An Incremental Approach
2017
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence
argumentation frameworks (AFs) are a well-known formalism for modelling and deciding many argumentation problems. Computational issues and evaluation algorithms have been deeply investigated for static AFs, whose structure does not change over the time. However, AFs are often dynamic as a consequence of the fact that argumentation is inherently dynamic. In this paper, we tackle the problem of incrementally computing extensions for dynamic AFs: given an initial extension and an update (or a set
doi:10.24963/ijcai.2017/8
dblp:conf/ijcai/AlfanoGP17
fatcat:6xr2fsgrxnfspnob667xupzgle