CF2-extensions as answer-set models
Document typeConference report
Rights accessOpen Access
Extension-based argumentation semantics have shown to be a suitable approach for performing practical reasoning. Since extension-based argumentation semantics were formalized in terms of relationships between atomic arguments, it has been shown that extension-based argumentation semantics based on admissible sets such as stable semantics can be characterized in terms of answer sets. In this paper, we present an approach for characterizing SCC-recursive semantics in terms of answer set models. In particular, we will show a characterization of CF2 in terms of answer set models. This result suggests that not only extension-based argumentation semantics based on admissible sets can be characterized in terms of answer sets; but also extension-based argumentation semantics based on Strongly Connected Components can be characterized in terms of answer sets.
CitationOsorio, M.; Nieves, J. C.; Ignasi Gómez-Sebastià. CF2-extensions as answer-set models. A: International Conference on Computational Models of Argument. "Proceedings of the COMMA2010 Conference". Desenzano del Garda: IOS Press, 2010, p. 391-402.