Revisiting Unrestricted Rebut and Preferences in Structured Argumentation.
Authors: Jesse Heyninck, Christian Straßer
IJCAI 2017 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | Our resulting system satisfies the usual rationality postulates for prioritized rule bases. and Theorem 1. | Ge Re satisfies Direct Consistency, Closure, Indirect Consistency and Non-Interference for any AS = (L, S, D, K, , ) such that S is closed under T, R and C and is a total preorder. |
| Researcher Affiliation | Academia | Jesse Heyninck and Christian Straßer Ruhr University Bochum, Germany jesse.heyninck@rub.de, christian.strasser@rub.de |
| 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 | The paper is theoretical and does not involve the use of datasets, therefore no training data access information is provided. |
| Dataset Splits | No | The paper is theoretical and does not involve the use of datasets for empirical validation, thus no dataset split information is provided. |
| Hardware Specification | No | The paper is theoretical and does not involve computational experiments, so no hardware specifications are mentioned. |
| Software Dependencies | No | The paper is theoretical and does not discuss specific software dependencies with version numbers required for replication. |
| Experiment Setup | No | The paper is theoretical and does not describe any experimental setup details, hyperparameters, or training configurations. |