Confluence

A semantics σ\sigma satisfies Confluence iff for every E∈σ(F)E \in \sigma(F) and E′⊊EE' \subsetneq E with E′∈σ(F)E' \in \sigma(F), we have E∖E′∈σE \setminus E' \in \sigma(FE′)(F^{E'}). It is the converse of Modularisation.

Reference

Bengel, L. & Thimm, M. (2026). Serialisability in Formal Argumentation. Preprint, Zenodo.