Reasoning over Argument-Incomplete AAFs in the Presence of Correlations
Authors: Bettina Fazzinga, Sergio Flesca, Filippo Furfaro
IJCAI 2021 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | We characterize the complexities of the problems DSAT of deciding the satisfiability of the dependencies and PDVERσ(S) of verifying extensions under the possible perspective. We show how they depend on the forms of dependencies and, for PDVERσ(S), also on the semantics of the extensions. Table 1 summarizes our results. Theorem 1 The complexity of DSAT, for the various restrictions on the set of allowed forms of dependencies, is that reported on the second column of Table 1. Theorem 2 PDVERσ(S) is in NP for σ {ad, st, co, gr} and in Σp 2 for σ = pr. |
| Researcher Affiliation | Academia | Bettina Fazzinga1 , Sergio Flesca2 , Filippo Furfaro2 1 ICAR-CNR, Italy 2 DIMES Universit a della Calabria, Italy fazzinga@icar.cnr.it, {flesca, furfaro}@dimes.unical.it |
| Pseudocode | No | The paper describes theoretical results and reductions but does not include pseudocode or clearly labeled algorithm blocks. |
| Open Source Code | No | The paper does not mention providing access to source code for the methodology described. |
| Open Datasets | No | This is a theoretical paper and does not involve the use of datasets for training or evaluation. |
| Dataset Splits | No | As this is a theoretical paper, there is no mention of dataset splits (training, validation, or test) for experimental reproduction. |
| Hardware Specification | No | As this is a theoretical paper, no hardware specifications for running experiments are mentioned. |
| Software Dependencies | No | As this is a theoretical paper, no software dependencies with version numbers are mentioned. |
| Experiment Setup | No | As this is a theoretical paper, no experimental setup details or hyperparameters are discussed. |