Semantics of Extended Argumentation Frameworks Defined by Renovation Sets
Dung’s theory of abstract argumentation frameworks plays an increasingly important role in artificial intelligence. Extended argumentation frameworks extend Dung’s AF by considering attacks on attacks. In this paper we introduce a new EAF semantics that deals with infinite deductive defence. This EAF semantics is underpinned by a new notion called renovation sets. Based on this, the concepts of conflict-freeness and acceptability are re-defined.
This work is supported by the NSFC (11601288) and the Natural Science Foundation of Shandong (ZR2016AQ21). The authors appreciate Professor P. Baroni, Professor C. Cayrol and Professor M. Giacomin for their constructive advice. They thank the anonymous reviewers for their helpful comments.
- 3.Cayrol, C., Cohen, A., Lagasquie-Schiex, M.C.: Towards a new framework for recursive interactions in abstract bipolar argumentation. In: Proceedings of COMMA 2016, pp. 191–198. IOS Press (2016)Google Scholar
- 4.Cohen, A., Gottiferedi, S., García, A.J., Simari, G.R.: On the acceptability semantics of argumentation frameworks with recursive attack and support. In: Proceedings of COMMA 2016, pp. 231–242. IOS Press (2016)Google Scholar