作者: Beishui Liao , Li Jin , Robert C. Koons
DOI: 10.1016/J.ARTINT.2011.03.006
关键词: Artificial intelligence 、 Theoretical computer science 、 Knowledge representation and reasoning 、 Argumentation framework 、 Argumentation theory 、 Ideal (set theory) 、 Proof theory 、 Set (psychology) 、 Probabilistic argumentation 、 Computer science 、 Semantics (computer science)
摘要: The changing of arguments and their attack relation is an intrinsic property a variety argumentation systems. So, it very important to efficiently figure out how the status in system evolves when updated. However, unlike other areas that have been deeply explored, such as semantics, proof theories, algorithms, etc., dynamics systems has comparatively neglected. In this paper, we formulate general theory (called division-based method) cope with problem based on new concept: division framework. When framework updated, divided into three parts: unaffected, affected, conditioning part. unaffected sub-framework remains unchanged, while affected computed special conditioned framework, or briefly CAF) composed part We proved under certain semantics satisfies directionality criterion (complete, preferred, ideal, grounded semantics), extensions updated are equal result combination sets set assigned CAFs. Due efficiency method, expected be useful various kinds where attacks dynamics.