研究不完整论证框架中一组论点稳定性的相关性，提升论证推理的可靠性。
Relevance for Stability of Verification Status of a Set of Arguments in Incomplete Argumentation Frameworks (with Proofs)
- 提出集合稳定性相关性概念，判断需消除哪些不确定性才能保证结论一致。
- 在多数语义下，检测相关性可在多项式时间内完成，效率较高。
- 适合关注论证系统鲁棒性与形式化验证的研究者阅读。
2024年，Odekerken等人提出了不完整论证框架（IAFs）中单个论点稳定性的相关性概念。本文进一步扩展该概念，研究一组论点的验证状态稳定性相关性，即在何种情况下必须消除某些不确定性，才能确保在所有可能的完备化中，给定论点集是否为扩展的结果保持一致。我们还提出了强相关性概念，描述在所有达到稳定状态的情境中消除不确定性的必要性。复杂性分析表明，在论文讨论的大多数语义下，检测（强）相关性可在多项式时间内实现。此外，我们讨论了在基底语义下寻找可有效检测相关性的方法所面临的困难。
原文摘要 · Abstract (English)
The notion of relevance was proposed for stability of justification status of a single argument in incomplete argumentation frameworks (IAFs) in 2024 by Odekerken et al. To extend the notion, we study the relevance for stability of verification status of a set of arguments in this paper, i.e., the uncertainties in an IAF that have to be resolved in some situations so that answering whether a given set of arguments is an extension obtains the same result in every completion of the IAF. Further we propose the notion of strong relevance for describing the necessity of resolution in all situations reaching stability. An analysis of complexity reveals that detecting the (strong) relevance for stability of sets of arguments can be accomplished in P time under the most semantics discussed in the paper. We also discuss the difficulty in finding tractable methods for relevance detection under grounded semantics.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。