News on Temporal Conjunctive Queries

Temporal query languages are important for stream processing, and ontologies for stream reasoning. Temporal conjunctive queries (TCQs) have therefore been investigated recently together with description logic ontologies, and the knowledge we have about the combined complexities is rather complete. However, often the size of the queries and the ontology is negligible, and what costs is the data. We prove a new result on the data complexity of ontology-based TCQ answering and close the gap between co-NP and ExpTime for many description logics.