Temporalized
Authors: EL
IJCAI 2016 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | We study access to temporal data with TEL, a temporal extension of the tractable description logic EL. Our aim is to establish a clear computational complexity landscape for the atomic query answering problem, in terms of both data and combined complexity. Atomic queries in full TEL turn out to be undecidable even in data complexity. Motivated by the negative result, we identify well-behaved yet expressive fragments of TEL. Our main contributions are a semantic and sufficient syntactic conditions for decidability and three orthogonal tractable fragments, which are based on restricted use of rigid roles, temporal operators, and novel acyclicity conditions on the ontologies. |
| Researcher Affiliation | Academia | 1 Department of Computer Science, Universit at Bremen, Germany 2 Department of Computer Science and Information Systems, Birkbeck, University of London, UK |
| Pseudocode | No | The paper describes conceptual procedures and rules (e.g., "saturation (chase-like) procedure" or rules for DATALOG1S rewriting) using prose and mathematical notation, but it does not include any structured pseudocode or algorithm blocks. |
| Open Source Code | No | The paper does not provide any explicit statements about releasing source code or links to a code repository for the work described. |
| Open Datasets | No | This paper is theoretical and focuses on computational complexity and logical systems. It does not involve empirical experiments with datasets, and therefore, does not mention training dataset splits. |
| Dataset Splits | No | This paper is theoretical and focuses on computational complexity and logical systems. It does not involve empirical experiments with datasets, and therefore, does not mention validation dataset splits. |
| Hardware Specification | No | This paper is theoretical and focuses on computational complexity. It does not describe running empirical experiments that would require specific hardware, and thus, does not mention any hardware specifications. |
| Software Dependencies | No | The paper discusses logical systems and theoretical concepts (e.g., DATALOG1S, LTL formulas) but does not list specific software dependencies with version numbers for empirical replication or implementation. |
| Experiment Setup | No | This paper is theoretical and focuses on computational complexity. It does not describe empirical experiments with specific setups, hyperparameters, or training configurations. |