Weak SCC Decomposability

A weaker form of SCC Decomposability in which the local function also receives the set of all possible input labellings, not only the actual one.

Reference

Dauphin, J., Rienstra, T. & van der Torre, L. (2020). A Principle-Based Analysis of Weakly Admissible Semantics. In: Computational Models of Argument (COMMA 2020), FAIA 326, pp. 167–178. IOS Press.