|
Título:
|
CF2-extensions as answer-set models
|
|
Autor/a:
|
Osorio, Mauricio; Nieves Sánchez, Juan Carlos; Gómez Sebastià, Ignasi
|
|
Otros autores:
|
Universitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics; Universitat Politècnica de Catalunya. KEMLG - Grup d'Enginyeria del Coneixement i Aprenentatge Automàtic |
|
Abstract:
|
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. |
|
Abstract:
|
Peer Reviewed |
|
Materia(s):
|
-Àrees temàtiques de la UPC::Informàtica::Intel·ligència artificial
-Answer-set semantics
-Argumentation theory
-Teoría de l'argumentació |
|
Derechos:
|
|
|
Tipo de documento:
|
Artículo - Borrador
Objeto de conferencia |
|
Editor:
|
IOS Press
|
|
Compartir:
|
|
