Coalition of Arguments

A set $C \subseteq A$ is a coalition of a BAF $B = (A, R, S)$ iff $C$ is conflict-free in $(A, R)$ , connected in $(A, S)$ , and $\subseteq$ -maximal with both properties.

Reference

Cayrol, C. & Lagasquie-Schiex, M.-C. (2010). Coalitions of Arguments: A Tool for Handling Bipolar Argumentation Frameworks. International Journal of Intelligent Systems, 25(1), pp. 83–109.

Referenced by

Coalition Graph