Temporal Query Answering in the Description Logic EL
Authors: Stefan Borgwardt, Veronika Thost
IJCAI 2015 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | We investigate temporalized OBDA w.r.t. ontologies formulated in EL, a description logic that allows for efficient reasoning and is successfully used in practice. We consider a recently proposed temporalized query language that combines conjunctive queries with the operators of propositional linear temporal logic (LTL), and study both data and combined complexity of query entailment in this setting. We also analyze the satisfiability problem in the similar formalism EL-LTL. |
| Researcher Affiliation | Academia | Stefan Borgwardt and Veronika Thost Technische Universität Dresden, Germany firstname.lastname@tu-dresden.de |
| Pseudocode | No | The paper does not contain structured pseudocode or algorithm blocks. |
| Open Source Code | No | The paper does not provide concrete access to source code for the methodology described. |
| Open Datasets | No | This is a theoretical paper and does not use datasets for training, testing, or validation in an empirical sense. |
| Dataset Splits | No | This is a theoretical paper and does not provide specific dataset split information for validation. |
| Hardware Specification | No | This is a theoretical paper and does not describe any hardware used for experiments. |
| Software Dependencies | No | This is a theoretical paper and does not list specific ancillary software dependencies with version numbers for experimental replication. |
| Experiment Setup | No | This is a theoretical paper and does not provide specific experimental setup details such as hyperparameters or training configurations. |