SCC-recursiveness: a general schema for argumentation semantics

  • Authors:

  • Pietro Baroni;Massimiliano Giacomin;Giovanni Guida

  • Affiliations:

  • Dipartimento di Elettronica per l'Automazione, Università di Brescia, Via Branze 38, I-25123 Brescia, Italy;Dipartimento di Elettronica per l'Automazione, Università di Brescia, Via Branze 38, I-25123 Brescia, Italy;Dipartimento di Elettronica per l'Automazione, Università di Brescia, Via Branze 38, I-25123 Brescia, Italy

  • Venue:
  • Artificial Intelligence
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

In argumentation theory, Dung's abstract framework provides a unifying view of several alternative semantics based on the notion of extension. In this context, we propose a general recursive schema for argumentation semantics, based on decomposition along the strongly connected components of the argumentation framework. We introduce the fundamental notion of SCC-recursiveness and we show that all Dung's admissibility-based semantics are SCC-recursive, and therefore a special case of our schema. On these grounds, we argue that the concept of SCC-recursiveness plays a fundamental role in the study and definition of argumentation semantics. In particular, the space of SCC-recursive semantics provides an ideal basis for the investigation of new proposals: starting from the analysis of several examples where Dung's preferred semantics gives rise to questionable results, we introduce four novel SCC-recursive semantics, able to overcome the limitations of preferred semantics, while differing in other respects.