Tractable Interval Temporal Propositional and Description Logics
Authors: Alessandro Artale, Roman Kontchakov, Vladislav Ryzhikov, Michael Zakharyaschev
AAAI 2015 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | We design a tractable Horn fragment of the Halpern-Shoham temporal logic and extend it to interval-based temporal description logics, instance checking in which is P-complete for both combined and data complexity. |
| Researcher Affiliation | Academia | Faculty of Computer Science Free University of Bozen-Bolzano, Italy Birkbeck, University of London, U.K. |
| Pseudocode | No | The paper describes procedures like the 'chase procedure' in prose, but it does not include a formal pseudocode or algorithm block. |
| Open Source Code | No | The paper does not provide any links to open-source code for the methodology described. It refers to a full version PDF. |
| Open Datasets | No | This is a theoretical paper focusing on logic design and complexity. It does not involve empirical studies with datasets or data splitting. |
| Dataset Splits | No | This is a theoretical paper focusing on logic design and complexity. It does not involve empirical studies with data splits for training, validation, or testing. |
| Hardware Specification | No | This is a theoretical paper that focuses on computational complexity and logic design. It does not describe any experimental setup or the specific hardware used. |
| Software Dependencies | No | This is a theoretical paper. It does not describe empirical experiments and therefore does not list any specific software dependencies with version numbers. |
| Experiment Setup | No | This is a theoretical paper. It does not describe any empirical experiments or their setup, including hyperparameters or system-level training settings. |