SCC-recursiveness: a general schema for argumentation semantics

By Pietro Baroni, Massimiliano Giacomin, G. Guida. Artificial Intelligence, 2005

357 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Argumentation in artificial intelligence (2007, background): “[21,23] define various extension-based semantics for an AF building from the strongly-connected component (SCC) decomposition of its directed graph: of the resulting SCC-recursive semantics, CF2-semantics have been examined in depth in [23].”
The Carneades model of argument and burden of proof (2007, neutral): “The object is illuminated by a red light.”
On principle-based evaluation of extension-based argumentation semantics (2007, background): “It has been shown in [6] that all semantics encompassed by Dung’s framework are SCC-recursive and the relevant base functions have been identified.”
Using arguments for making and explaining decisions (2009, neutral): “[13]).”
Semi-stable semantics (2006, background): “Equally important is the issue of how arguments are 8 This also raises some tricky questions for other semantics that are not admissibility based, such as CF2 [6].”
An introduction to argumentation semantics (2011, methodology): “We also treat two additional semantics, namely stage (Verheij, 1996) and CF2 semantics (Baroni et al ., 2005).”