SCC Decomposability

A semantics $\sigma$ satisfies SCC Decomposability iff its labellings on any framework are exactly the combinations of labellings that a local function assigns to each SCC, given the labelling of the SCC's attackers as input. Defined for labelling-based semantics.

Reference

Baroni, P., Boella, G., Cerutti, F., Giacomin, M., van der Torre, L. & Villata, S. (2014). On the Input/Output Behavior of Argumentation Frameworks. Artificial Intelligence, 217, pp. 144–197.

Referenced by

Qualified Semantics
Semi-Qualified Semantics
Qualified Local Function
Semi-Qualified Weak Local Function
Weak SCC Decomposability