A Study of Unrestricted Abstract Argumentation Frameworks
Authors: Ringo Baumann, Christof Spanring
IJCAI 2017 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | In this paper we study a bunch of abstract properties like SCC-recursiveness, expressiveness or intertranslatability for unrestricted AFs. As a matter of fact, almost all existing research on abstract argumentation is restricted to finite AFs, and thus there is no systematic analysis of abstract properties in the unrestricted case. |
| Researcher Affiliation | Academia | Ringo Baumann Leipzig University, Germany baumann@informatik.uni-leipzig.de Christof Spanring University of Liverpool, United Kingdom TU Wien, Austria christof.spanring@tuwien.ac.at |
| Pseudocode | No | The paper describes theoretical concepts and formal definitions but does not contain structured pseudocode or algorithm blocks. |
| Open Source Code | No | The paper does not contain any statement about making source code openly available or provide links to a code repository for the described methodology. |
| Open Datasets | No | The paper focuses on theoretical analysis and does not use or refer to any publicly available datasets. |
| Dataset Splits | No | The paper describes theoretical work and does not mention any training, validation, or test dataset splits. |
| Hardware Specification | No | The paper describes theoretical work and does not mention any specific hardware used for experiments. |
| Software Dependencies | No | The paper describes theoretical work and does not mention specific software dependencies with version numbers. |
| Experiment Setup | No | The paper describes theoretical work and does not include details on experimental setup or hyperparameters. |