Expand description
Derived attack closure per Cayrol & Lagasquie-Schiex 2005 and Amgoud et al. 2008 §3.
Given a BipolarFramework, compute the set of all attacks (direct
plus derived) that hold under necessary-support semantics. Three
derivation rules:
- Direct: every edge in the attack set is an attack.
- Supported: if
Atransitively supportsXandXdirectly attacksB, thenAattacksB. - Secondary/Mediated: if
Adirectly attacksXandXtransitively supportsC, thenAattacksC. (Amgoud et al. distinguishes secondary and mediated but both produce the same edges under the necessary-support reading.)
The closure is computed as a fixed point over all three rules
applied together. For a framework with n arguments, convergence is
bounded by n iterations and the closure has at most n² edges.
Functions§
- closed_
attacks - Compute the closed attack set for a bipolar framework under necessary-support semantics.