← 피드로
[Submitted on 16 Aug 2026 (v1), last revised 5 Sep 2026 (this version, v2)]
Abstract:In value-based argumentation, an audience’s ordering of values decides which attacks succeed as defeats. In many settings the deciding factor is not the audience but the circumstances: the same attack may succeed at one procedural stage, or under one regulation, and fail at another. Context-dependent argumentation frameworks (CDAFs), a model we recently introduced, capture this directly: one attack relation and a defeat function that switches each attack on or off per context, so every context induces an ordinary Dung framework. This raises a reduction question: can one value assignment with per-context orderings reproduce the defeat function, collapsing the CDAF into a VAF? We present a polynomial-time decision procedure for this question and map the harder neighbouring problems, with upper bounds from NP to $\Sigma^p_3$. We also present a validated reference implementation and a measurement: representability is rare and falls fast with the number of contexts.
Submission history
From: Albert Sadowski [view email]
[v1]
Sun, 16 Aug 2026 05:18:56 UTC (16 KB)
[v2]
Sat, 5 Sep 2026 06:01:26 UTC (17 KB)
추출 본문 · 출처: arxiv.org · https://arxiv.org/abs/2608.15536