Full Decomposability

A semantics $\sigma$ satisfies Full Decomposability iff there is a local function such that, for every partition of the arguments into parts, its labellings are exactly the combinations of local labellings of the parts, each computed with the labelling of its attackers from other parts as input.