Argumentation Frameworks with Strong and Weak Constraints: Semantics and Complexity
Authors: Gianvincenzo Alfano, Sergio Greco, Francesco Parisi, Irina Trubitsyna6175-6184
AAAI 2021 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | We provide a detailed complexity analysis of CAFs and WAFs, showing that strong constraints do not increase the expressive power of AFs in most cases, while weak constraints systematically increase the expressive power of CAFs under several wellknown argumentation semantics. |
| Researcher Affiliation | Academia | Gianvincenzo Alfano, Sergio Greco, Francesco Parisi, Irina Trubitsyna Department of Informatics, Modeling, Electronics and System Engineering, University of Calabria, Italy {g.alfano, greco, fparisi, i.trubitsyna}@dimes.unical.it |
| Pseudocode | No | The paper does not contain any structured pseudocode or algorithm blocks. |
| Open Source Code | No | The paper does not provide any concrete access to source code for the methodology described. |
| Open Datasets | No | The paper is theoretical and does not use or reference any datasets for training or empirical evaluation. |
| Dataset Splits | No | The paper is theoretical and does not describe any training, validation, or test splits for empirical experiments. |
| Hardware Specification | No | The paper is theoretical and does not mention any specific hardware used for experiments. |
| Software Dependencies | No | The paper is theoretical and does not list specific software dependencies with version numbers, although it mentions the DLV system in the context of related work. |
| Experiment Setup | No | The paper is theoretical and does not describe any experimental setup details such as hyperparameters or training configurations. |