The Relative Expressiveness of Abstract Argumentation and Logic Programming
Authors: Hannes Strass
AAAI 2015 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | We analyze the relative expressiveness of the two-valued semantics of abstract argumentation frameworks, normal logic programs and abstract dialectical frameworks. By expressiveness we mean the ability to encode a desired set of two-valued interpretations over a given propositional vocabulary A using only atoms from A. |
| Researcher Affiliation | Academia | Hannes Strass Computer Science Institute Leipzig University, Germany strass@informatik.uni-leipzig.de |
| Pseudocode | No | The paper does not contain any structured pseudocode or algorithm blocks. |
| Open Source Code | No | The paper does not provide an explicit statement or link to open-source code for the methodology described. |
| Open Datasets | No | The paper is theoretical and does not involve empirical studies with datasets. |
| Dataset Splits | No | The paper is theoretical and does not involve empirical studies with datasets, therefore no training/validation/test splits are mentioned. |
| Hardware Specification | No | The paper is theoretical and does not provide specific hardware details for any computations performed. |
| Software Dependencies | No | The paper mentions using the solver clasp (Gebser et al. 2011), but does not provide a specific version number for it or any other software dependencies. |
| Experiment Setup | No | The paper is theoretical and focuses on formal analysis rather than experimental setup details. |