SCC-Recursiveness

A semantics $\sigma$ satisfies SCC-Recursiveness iff it can be defined by the SCC-recursive scheme: its extensions are computed SCC by SCC, applying a base function to each component.

Reference

Baroni, P., Giacomin, M. & Guida, G. (2005). SCC-Recursiveness: A General Schema for Argumentation Semantics. Artificial Intelligence, 168(1–2), pp. 162–210.