Argumentation is a dynamic process. The enforcing problem in argumentation, i.e. the question whether it is possible to modify a given argumentation framework (AF) in such a way that a desired set of arguments becomes an extension or a subset of an extension, was first studied in and positively answered under certain conditions. In this paper, we take up this research and study the more general problem of minimal change. That is, in brief, i) is it possible to enforce a desired set of arguments, and if so, ii) what is the minimal number of modifications (additions or removals of attacks) to reach such an enforcement, the so-called characteristic. We show for several Dung semantics that this problem can be decided by local criteria encoded by the so-called value functions. Furthermore, we introduce the corresponding equivalence notions between two AFs which guarantee equal minimal efforts needed to enforce certain subsets, namely minimal-E-equivalence and the more general minimal change equivalence. We present characterization theorems for several Dung semantics and finally, we show the relations to standard and the recently proposed strong equivalence for a whole range of semantics.
展开▼
机译：论证是一种动态过程。参数中的强制问题，即，是否可以以这样的方式修改给定的参数框架（AF）的问题，即所需的一组参数成为扩展或扩展的子集，首先在且正相关地回答一定条件下。在本文中，我们采取了这项研究，研究了最小变化的一般问题。简而言之，I）可以实施所需的一组参数，如果是，ii）II）是什么是达到这种执法的最小修改数量（添加或攻击），所谓的特征。我们展示了几个粪便语义，即这个问题可以通过所谓的值函数编码的本地标准来决定。此外，我们在两个AF之间介绍了相应的等效概念，这保证了实施某些子集所需的相同的最小努力，即最小 - E - 等价和更通用的最小变化等价。我们为几种粪便语义呈现了特征定理，最后，我们展示了与标准的关系，最近提出了整个语义的强大等价。
展开▼
