Argumentation is one of the most relevant fields in the sphere of Artificial Intelligence. In particular, Dung’s abstract argumentation framework (AF) has received much attention in the last twenty years, and many computational issues have been investigated for different argumentation semantics. Specifically, enumerating the sets of arguments prescribed by an argumentation semantics (i.e., extensions) is arguably one of the most challenging problems for AFs, and this is the case also for the well-known semi-stable semantics. In this paper, we propose an algorithm for efficiently computing the set of semi-stable extensions of a given AF. Our technique relies on exploiting the computation of grounded extension to snip some arguments in order to obtain a smaller framework (called cut-AF) over which state-of-the-art solvers for enumerating the semi-stable extensions are called, as needed to return the extensions of the input AF. We experimentally evaluated our technique and found that our approach is orders of magnitude faster than the computation over the whole AF.

An Efficient Algorithm for Computing the Set of Semi-stable Extensions

Alfano G.
2019

Abstract

Argumentation is one of the most relevant fields in the sphere of Artificial Intelligence. In particular, Dung’s abstract argumentation framework (AF) has received much attention in the last twenty years, and many computational issues have been investigated for different argumentation semantics. Specifically, enumerating the sets of arguments prescribed by an argumentation semantics (i.e., extensions) is arguably one of the most challenging problems for AFs, and this is the case also for the well-known semi-stable semantics. In this paper, we propose an algorithm for efficiently computing the set of semi-stable extensions of a given AF. Our technique relies on exploiting the computation of grounded extension to snip some arguments in order to obtain a smaller framework (called cut-AF) over which state-of-the-art solvers for enumerating the semi-stable extensions are called, as needed to return the extensions of the input AF. We experimentally evaluated our technique and found that our approach is orders of magnitude faster than the computation over the whole AF.
978-3-030-27628-7
978-3-030-27629-4
Abstract argumentation
Enumeration of semi-stable extensions
Semi-stable semantics
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/327569
 Attenzione

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

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