A Study of Argumentative Characterisations of Preferred Subtheories
Authors: Marcello D'Agostino, Sanjay Modgil
IJCAI 2018 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | This paper is the first to establish these characterisations for the preferred semantics, by showing that the preferred and stable extensions of (dialectical) AFs instantiated by default theories coincide.These results imply that argument game proof theories and algorithms for deciding membership of arguments in admissible extensions, suffice for realising the practical use of argumentation in deciding credulous Preferred Subtheories inference by single agents, and in distributed reasoning amongst multiple agents. |
| Researcher Affiliation | Academia | 1 Department of Philosophy, University of Milan 2 Department of Informatics, King s College London marcello.dagostino@unimi.it, sanjay.modgil@kcl.ac.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. |
| Open Datasets | No | The paper is theoretical and does not use or refer to any publicly available datasets for experimental evaluation. |
| Dataset Splits | No | The paper is theoretical and does not describe dataset splits for training, validation, or testing. |
| 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 mention specific software dependencies for any experimental setup. |
| Experiment Setup | No | The paper is theoretical and does not describe an experimental setup with hyperparameters or training configurations. |