论文标题
抽象论证中的稳定性
Stability in Abstract Argumentation
论文作者
论文摘要
结构化论证设置中稳定的概念表征了与给定文字相关的接受状态不会受到本设置的任何未来演变的影响。在本文中，我们从参数的逻辑结构中抽象出来，并将这种稳定性的概念转移到了Dungean论证框架的背景下。特别是，我们展示了如何将这个问题转化为参数分配的AFS推理。然后，在可信和怀疑推理的情况下，我们在四种突出的语义下为稳定性提供了初步的复杂性结果。最后，我们说明了在基于参数的谈判中应用程序在多大程度上有用。
The notion of stability in a structured argumentation setup characterizes situations where the acceptance status associated with a given literal will not be impacted by any future evolution of this setup. In this paper, we abstract away from the logical structure of arguments, and we transpose this notion of stability to the context of Dungean argumentation frameworks. In particular, we show how this problem can be translated into reasoning with Argument-Incomplete AFs. Then we provide preliminary complexity results for stability under four prominent semantics, in the case of both credulous and skeptical reasoning. Finally, we illustrate to what extent this notion can be useful with an application to argument-based negotiation.
