The changing of arguments and their attack relation is an intrinsic property of a variety of argumentation systems. So, it is very important to efficiently figure out how the status of arguments in a system evolves when the system is updated. However, unlike other areas of argumentation that have been deeply explored, such as argumentation semantics, proof theories, and algorithms, etc., dynamics of argumentation systems has been comparatively neglected. In this paper, we introduce a general theory (called a division-based method) to cope with this problem based on a new concept: the division of an argumentation framework. When an argumentation framework is updated, it is divided into three parts: an unaffected, an affected, and a conditioning part. The status of arguments in the unaffected sub-framework remains unchanged, while the status of the affected arguments is computed in a special argumentation framework (called a conditioned argumentation framework, or briefly CAF) that is composed of an affected part and a conditioning part. We have proved that under a certain semantics that satisfies the directionality criterion (complete, preferred, ideal, or grounded semantics), the extensions of the updated framework are equal to the result of a combination of the extensions of an unaffected sub-framework and sets of the extensions of a set of assigned CAFs. The theory shows that the complexity of computing the dynamics of argumentation will decrease to a lesser or greater extent, depending on the types of argumentation semantics, the topologies of argumentation frameworks, and the number of affected arguments with respect to an addition or a deletion. As a result, this theory is expected to be very useful in various kinds of argumentation systems where arguments and attacks are dynamics, due to the changing of underlying knowledge and information.
DIALOGICAL LINGUISTICS IN RUSSIA: THE HISTORY OF FORMATION AND THE CURRENT STATUS
