Preferences and Constraints in Abstract Argumentation
Authors: Gianvincenzo Alfano, Sergio Greco, Francesco Parisi, Irina Trubitsyna
IJCAI 2023 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | After investigating the complexity of the resulting framework, as both constraints and preferences may represent subjective knowledge of agents, we extend our framework by considering multiple agents and study the complexity of deciding acceptance of arguments in this context. We study the complexity of the verification (Verσ) as well as credulous (CAσ) and skeptical (SAσ) acceptance problems, and show that in most of the cases (i) it increases by one level in the polynomial hierarchy w.r.t. that of AF, and (ii) is the same as that of PAF under KTV criterion (see Table 1). |
| Researcher Affiliation | Academia | Gianvincenzo Alfano , Sergio Greco , Francesco Parisi and Irina Trubitsyna DIMES Department, University of Calabria, Rende, Italy {g.alfano, greco, fparisi, i.trubitsyna}@dimes.unical.it |
| Pseudocode | No | The paper does not contain structured pseudocode or algorithm blocks. |
| Open Source Code | No | The paper does not provide any concrete access information for source code related to the described methodology. |
| Open Datasets | No | The paper is theoretical and does not use datasets in the context of empirical studies or training models. |
| Dataset Splits | No | The paper is theoretical and does not involve empirical experiments with training, validation, or test dataset splits. |
| Hardware Specification | No | The paper is theoretical and does not describe hardware used for experiments. |
| Software Dependencies | No | The paper is theoretical and does not specify software dependencies with version numbers. |
| Experiment Setup | No | The paper is theoretical and does not describe an experimental setup with hyperparameters or training configurations. |