Abstract Argumentation Frameworks with Domain Assignments
Authors: Alexandros Vassiliades, Theodore Patkos, Giorgos Flouris, Antonis Bikakis, Nick Bassiliades, Dimitris Plexousakis
IJCAI 2021 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | In this paper, we propose an argumentation formalism that allows associating arguments with a domain of application. Appropriate semantics are given, which formalise the notion of partial argument acceptance, i.e., the set of objects or relations that an argument can be applied to. We show that our proposal is in fact equivalent to the standard Argumentation Frameworks of Dung, but allows a more intuitive and compact expression of some core concepts of commonsense and non-monotonic reasoning, such as the scope of an argument, exceptions, relevance and others. |
| Researcher Affiliation | Academia | 1Aristotle University of Thessaloniki, School of Informatics, Hellas 2Foundation for Research and Technology, Institute of Computer Science, Hellas 3University College London, Department of Information Studies, UK |
| Pseudocode | No | The paper does not contain structured pseudocode or algorithm blocks. |
| Open Source Code | No | The paper does not provide concrete access to source code for the methodology described. |
| Open Datasets | No | The paper is theoretical and does not mention using any public or open datasets for training or evaluation. |
| Dataset Splits | No | The paper is theoretical and does not describe experimental validation or data splitting. |
| Hardware Specification | No | The paper is theoretical and does not describe any specific 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 configurations. |