The Complexity of Reasoning with FODD and GFODD
Authors: Benjamin Hescott, Roni Khardon
AAAI 2014 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | In this paper, we study the complexity of the evaluation problem, the satisfiability problem, and the equivalence problem for GFODDs under the assumption that the size of the intended model is given with the problem, a restriction that guarantees decidability. Our results provide a complete characterization. |
| Researcher Affiliation | Academia | Benjamin J. Hescott and Roni Khardon Department of Computer Science, Tufts University Medford, MA, USA {hescott|roni}@cs.tufts.edu |
| Pseudocode | No | The paper does not contain structured pseudocode or algorithm blocks with clear labels like 'Pseudocode' or 'Algorithm'. |
| Open Source Code | No | The paper does not include any explicit statement about releasing source code for the methodology described, nor does it provide a link to a code repository. |
| Open Datasets | No | This is a theoretical paper focusing on complexity analysis and does not use or refer to publicly available datasets for training or evaluation. |
| Dataset Splits | No | As a theoretical paper, it does not describe experimental validation involving dataset splits. |
| Hardware Specification | No | This is a theoretical paper and does not mention any specific hardware used for computations or experiments. |
| Software Dependencies | No | The paper is theoretical and does not specify any software dependencies with version numbers needed for replication. |
| Experiment Setup | No | This paper is theoretical and does not include details on experimental setup, hyperparameters, or training configurations. |