Dealing with Generic Contrariness in Structured Argumentation
Authors: Pietro Baroni, Massimiliano Giacomin, Beishui Liao
IJCAI 2015 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | The paper provides a solution based on a novel notion of closure of the contrariness relation at the level of sets of formulas and an abstract representation of conflicts between sets of arguments. The proposed solution is shown to satisfy the same rationality postulates as ASPIC+ and represents a starting point for further technical and conceptual developments in structured argumentation. |
| Researcher Affiliation | Academia | Pietro Baroni, Massimiliano Giacomin DII, University of Brescia Brescia, Italy {pietro.baroni|massimiliano.giacomin}@unibs.it Beishui Liao Zhejiang University Univ. of Luxembourg Hangzhou, China Luxembourg baiseliao@zju.edu.cn |
| Pseudocode | No | The paper contains formal definitions and theorems but no pseudocode or algorithm blocks. |
| Open Source Code | No | The paper does not provide any statement or link for open-source code for the described methodology. |
| Open Datasets | No | The paper is theoretical and does not use or reference a publicly available dataset for training. |
| Dataset Splits | No | The paper is theoretical and does not describe training/validation/test splits. |
| 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 describe specific software dependencies with version numbers. |
| Experiment Setup | No | The paper is theoretical and does not include details about an experimental setup, hyperparameters, or training configurations. |