Combining DL-Lite_{bool}^N with Branching Time: A gentle Marriage
Authors: Víctor Gutiérrez-Basulto, Jean Christoph Jung
IJCAI 2017 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | For the resulting logics, we present algorithms for the satisfiability problem and (mostly tight) complexity bounds ranging from EXPTIME to 3EXPTIME. |
| Researcher Affiliation | Academia | V ıctor Guti errez-Basulto Cardiff University, UK gutierrezbasultov@cardiff.ac.uk Jean Christoph Jung Universit at Bremen, Germany jeanjung@informatik.uni-bremen.de |
| Pseudocode | No | The paper describes the algorithms and methods in textual form but does not provide structured pseudocode or algorithm blocks. |
| Open Source Code | No | The paper provides a link to an extended version with an appendix (http://tinyurl.com/ktkgwqg), but it does not state that source code for the described methodology is released or available. |
| Open Datasets | No | The paper is theoretical and does not involve empirical experiments with datasets, thus no dataset usage or public availability information is provided. |
| Dataset Splits | No | The paper is theoretical and does not involve empirical experiments with datasets, thus no training/test/validation splits are described. |
| Hardware Specification | No | The paper focuses on theoretical contributions (algorithms and complexity bounds) and does not describe empirical experiments, therefore no specific hardware specifications are mentioned. |
| Software Dependencies | No | The paper focuses on theoretical contributions and does not describe empirical experiments. Therefore, no specific software dependencies with version numbers for replication are mentioned. |
| Experiment Setup | No | The paper focuses on theoretical contributions and does not describe empirical experiments. Therefore, no specific experimental setup details like hyperparameters or training configurations are provided. |