A Fully Rational Account of Structured Argumentation Under Resource Bounds
Authors: Marcello D'Agostino, Sanjay Modgil
IJCAI 2020 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | In this paper we present a new version of ASPIC+ Dialectial ASPIC+ that is fully rational under resource bounds. This paper is the first to provide a formalisation of ASPIC+ Dialectical ASPIC+ (D-ASPIC+) that is fully rational under resource bounds: consistency, closure and non-contamination are satisfied, while making only minimal (i.e., relatively undemanding) assumptions as to the resources available for constructing arguments. |
| Researcher Affiliation | Academia | 1University of Milan 2Kings s College London |
| Pseudocode | No | The paper does not contain any structured pseudocode or algorithm blocks. |
| Open Source Code | No | The paper does not provide any statement or link regarding the availability of open-source code for the described methodology. |
| Open Datasets | No | This is a theoretical paper that does not use or reference any datasets for training or evaluation. |
| Dataset Splits | No | The paper is theoretical and does not involve experimental data, therefore no training/validation/test dataset splits are described. |
| Hardware Specification | No | The paper is theoretical and does not mention any specific hardware specifications used for running experiments. |
| Software Dependencies | No | The paper does not list any specific software dependencies with version numbers. |
| Experiment Setup | No | As a theoretical paper, it does not include details on experimental setup such as hyperparameters or training configurations. |