SCC-recursiveness: a general schema for argumentation semantics

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 th...

Full description

Saved in:
Bibliographic Details
Published in:Artificial intelligence 2005-10, Vol.168 (1), p.162-210
Main Authors: Baroni, Pietro, Giacomin, Massimiliano, Guida, Giovanni
Format: Article
Language:English
Subjects:
Applied sciences
Argumentation
Argumentation semantics
Artificial intelligence
Computer science
control theory
systems
Defeat cycles
Exact sciences and technology
Extensions
Learning and adaptive systems
Semantic analysis
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0004-3702
1872-7921
DOI:10.1016/j.artint.2005.05.006