Extended argumentation frameworks (EAFs) extend Dung’s argumentation frameworks (AFs) to represent a kind of defeasible attack (by relying on the concept of second-order attack), in addition to the Dung’s classical notion of attack between arguments. EAFs can be profitably used to model disputes between agents, with the aim of deciding the sets of arguments (called extensions) that should be accepted to support a point of view in a discussion. However, since new arguments and attacks are often introduced to take into account new available knowledge, EAFs as well as their extensions change over the time. In this paper we tackle the problem of efficiently recomputing extensions of dynamic EAFs under two well-known semantics (i.e., preferred and stable semantics). We introduce an incremental approach that, given an initial EAF, an initial extension for it, and an update, computes an extension of the updated EAF. This is achieved by introducing a meta-argumentation transformation according to which an initial EAF, as well as a given initial extension and an update, is transformed into a plain argumentation framework with a corresponding extension and update. The proposed approach is able to incorporate existing AF-solvers to compute an extension of the updated EAF. The experimental analysis showed that our technique is significantly faster than computing extensions of updated EAFs from scratch.

Computing extensions of dynamic abstract argumentation frameworks with second-order attacks

Alfano, Gianvincenzo;Greco, Sergio;Parisi, Francesco
2018

Abstract

Extended argumentation frameworks (EAFs) extend Dung’s argumentation frameworks (AFs) to represent a kind of defeasible attack (by relying on the concept of second-order attack), in addition to the Dung’s classical notion of attack between arguments. EAFs can be profitably used to model disputes between agents, with the aim of deciding the sets of arguments (called extensions) that should be accepted to support a point of view in a discussion. However, since new arguments and attacks are often introduced to take into account new available knowledge, EAFs as well as their extensions change over the time. In this paper we tackle the problem of efficiently recomputing extensions of dynamic EAFs under two well-known semantics (i.e., preferred and stable semantics). We introduce an incremental approach that, given an initial EAF, an initial extension for it, and an update, computes an extension of the updated EAF. This is achieved by introducing a meta-argumentation transformation according to which an initial EAF, as well as a given initial extension and an update, is transformed into a plain argumentation framework with a corresponding extension and update. The proposed approach is able to incorporate existing AF-solvers to compute an extension of the updated EAF. The experimental analysis showed that our technique is significantly faster than computing extensions of updated EAFs from scratch.
9781450365277
Abstract Argumentation; Dynamic Argumentation; Incremental Computation; Human-Computer Interaction; Computer Networks and Communications; 1707; Software
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.11770/285370
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 11
  • ???jsp.display-item.citation.isi??? ND
social impact