کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
376956 | 658346 | 2012 | 27 صفحه PDF | دانلود رایگان |
Given a semantics σ, two argumentation frameworks (AFs) F and G are said to be standard equivalent if they possess the same extensions and strongly equivalent if, for any AF H, F conjoined with H and G conjoined with H are standard equivalent. Argumentation is a dynamic process and, in general, new arguments occur in response to a former argument or, more precisely, attack a former argument. For this reason, rather than considering arbitrary expansions we focus here on expansions where new arguments and attacks may be added but the attacks among the old arguments remain unchanged. We define and characterize two new notions of equivalence between AFs (which lie in-between standard and strong equivalence), namely normal and strong expansion equivalence. Furthermore, using the characterization theorems proved in this paper, we draw the connections between all mentioned notions of equivalence including further equivalence relations, so-called weak and local expansion equivalence.
Journal: Artificial Intelligence - Volume 193, December 2012, Pages 18-44