This article is about busting loops in abstract argumentation networks. We propose several approaches to how to deal with networks which have loops (such as even or odd cycles) and get new extensions which are 'in', 'out' extensions, with no undecided elements.
|Number of pages||83|
|Journal||Journal of Logic and Computation|
|State||Published - 1 Aug 2016|
Bibliographical notePublisher Copyright:
© 2014 The Author, 2014. Published by Oxford University Press.
- Argumentation networks
- CF2 semantics
- Shkop extensions
- equational approach