Module reduce 

Dunne 2011 β-inconsistent residual enumeration.

Given a weighted framework WF and budget β, dunne_residuals returns the plain Dung framework obtained by dropping attacks in each subset S ⊆ attacks(WF) whose cumulative weight is at most β. The acceptance predicates in crate::semantics iterate these residuals to compute β-credulous and β-skeptical acceptance.

Complexity

Enumeration is O(2^m · f(n)) where m = |attacks(WF)|, n = |arguments(WF)|, and f(n) is the Dung semantics cost on the residual. ATTACK_ENUMERATION_LIMIT caps m at 24 to keep the factor manageable; larger frameworks return crate::Error::TooManyAttacks.

v0.1.0 → v0.2.0 migration note

v0.1.0 exposed reduce_at_budget(wf, β) -> ArgumentationFramework, a cumulative-threshold approximation that returned a single residual. That function is removed in v0.2.0: there is no canonical “the” residual under Dunne 2011, so the semantics layer iterates all residuals internally and callers should use crate::semantics acceptance predicates instead.

Constants

ATTACK_ENUMERATION_LIMIT

Upper bound on attack count for exact Dunne 2011 subset enumeration.

Functions

dunne_residuals

Enumerate the Dung residuals of framework at budget β.