Efficient Computation of Deterministic Extensions for Dynamic Abstract Argumentation Frameworks

We address the problem of efficiently computing the extensions of abstract argumentation frameworks (AFs) which are updated by adding/deleting arguments or attacks. We focus on the two most popular 'deterministic' semantics (namely, grounded and ideal) and present two approaches for their incremental computation, well-suited to dynamic applications where updates to an initial AF are frequently performed to take into account new available knowledge.

Authors

• Sergio Greco
• Francesco Parisi

Keywords

No keywords are indexed for this paper.