发表机构
Faculty of Electronics and Information Technology; Warsaw University of Technology（电子与信息技术学院; 华沙理工大学）
机构由 AI 辅助整理，请以论文原文为准。AI 中文总结
针对语境依赖式论辩框架能否归约为价值论辩框架的问题，研究提出多项式时间决策程序，梳理相关问题复杂度，发现其可表示性随语境数量增加快速下降。
AI 中文摘要
在价值论辩（value-based argumentation）中，受众的价值排序决定哪些攻击会作为击败（defeat）成功。在许多场景下，决定因素并非受众而是语境：同一攻击可能在某一程序阶段或某一规则下成功，而在另一阶段或规则下失败。语境依赖式论辩框架（context-dependent argumentation frameworks, CDAFs）是我们近期提出的模型，它直接捕捉了这一特性：一组论证、一套攻击关系，以及一个击败函数，该函数会根据每个语境开启或关闭每一项攻击，因此每个语境都会诱导出一个普通的Dung框架。这引出了一个归约问题：语境是否真的是新的概念，还是可以通过为每个语境分配价值排序的方式来复制击败函数，从而将CDAF归约为价值论辩框架（value-based argumentation framework, VAF）？我们针对该问题提出了一个多项式时间决策程序，并梳理了更难的相关问题，其复杂度上界从NP到Σ^p_3不等。我们还提供了一个经过验证的参考实现及测量结果：可表示性是罕见的，且会随语境数量的增加快速下降。
英文摘要
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 $Σ^p_3$. We also present a validated reference implementation and a measurement: representability is rare and falls fast with the number of contexts.
CommentsAccepted to SAFA workshop at COMMA 2026
