Probabilistic bipolar abstract argumentation frameworks: complexity results
Authors: Bettina Fazzinga, Sergio Flesca, Filippo Furfaro
IJCAI 2018 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | Probabilistic Bipolar Abstract Argumentation Frameworks (pr BAFs) are considered, and the complexity of the fundamental problem of computing extensions probabilities is addressed. |
| Researcher Affiliation | Academia | Bettina Fazzinga1 and Sergio Flesca2 and Filippo Furfaro2 1 ICAR CNR, Via P. Bucci, 87036 Rende (CS) Italy 2 DIMES Universit a della Calabria, Via P. Bucci, 87036 Rende (CS) Italy |
| Pseudocode | No | The paper does not include any pseudocode or clearly labeled algorithm blocks. |
| Open Source Code | No | The paper does not provide any concrete access information (e.g., repository links, explicit statements of code release) for open-source code related to the methodology. |
| Open Datasets | No | The paper is theoretical and does not conduct experiments involving datasets; therefore, no information about publicly available datasets is provided. |
| Dataset Splits | No | The paper is theoretical and does not involve empirical experiments, so it does not provide details on training, validation, or test dataset splits. |
| Hardware Specification | No | The paper is theoretical and does not involve empirical experiments, so no hardware specifications are mentioned. |
| Software Dependencies | No | The paper is theoretical and does not involve empirical experiments, so no specific software dependencies with version numbers are mentioned. |
| Experiment Setup | No | The paper is theoretical and focuses on complexity results, not empirical experiments; therefore, no experimental setup details like hyperparameters are provided. |