The status of arguments in abstract argumentation frameworks. A tableaux method
Dung’s argumentation frameworks are formalisms widely used to model interaction among arguments. Although their study has been profusely developed in the field of Artificial Intelligence, it is not common to see its treatment among those less connected to computer science within the logical-philosop...
| Autores: | , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2023 |
| País: | Brasil |
| Institución: | Universidade Estadual de Campinas (UNICAMP) |
| Repositorio: | Manuscrito (Online) |
| Idioma: | inglés |
| OAI Identifier: | oai:ojs.periodicos.sbu.unicamp.br:article/8674116 |
| Acceso en línea: | https://periodicos.sbu.unicamp.br/ojs/index.php/manuscrito/article/view/8674116 |
| Access Level: | acceso abierto |
| Palabra clave: | Estruturas de argumentação Semântica de extensão Quadros Argumentación Semántica de la ampliación Cuadros Argumentation frameworks Extension semantics Tableaux |
| Sumario: | Dung’s argumentation frameworks are formalisms widely used to model interaction among arguments. Although their study has been profusely developed in the field of Artificial Intelligence, it is not common to see its treatment among those less connected to computer science within the logical-philosophical community. In this paper we propose to bring to that audience a proof-theory for argument justification based on tableaux, very similar to those the Logic students are familiar with. The tableaux enable to calculate whether an argument or subset of arguments are accepted or rejected in accordance to Dung’s preferred and grounded extension-based semantics. Soundness and completeness results regarding those semantics are provided. |
|---|