Inferring preferred extensions by Pstable semantics
Given an argumentation framework AF, we present a normal program Psi_{AF}, such that the preferred extensions of AF correspond exactly with the pstable models of Psi_{AF}. Moreover, we motivate the notion of suitable codifications for developing metainterpreters of argumentation theory based on logi...
| Autores: | , |
|---|---|
| Tipo de recurso: | informe técnico |
| Fecha de publicación: | 2007 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/87510 |
| Acceso en línea: | https://hdl.handle.net/2117/87510 |
| Access Level: | acceso abierto |
| Palabra clave: | Argumentation theory Logic programming Non-monotonic reasoning Àrees temàtiques de la UPC::Informàtica::Intel·ligència artificial |
| Sumario: | Given an argumentation framework AF, we present a normal program Psi_{AF}, such that the preferred extensions of AF correspond exactly with the pstable models of Psi_{AF}. Moreover, we motivate the notion of suitable codifications for developing metainterpreters of argumentation theory based on logic programming. |
|---|