Data Complexity and Rewritability of Ontology-Mediated Queries in Metric Temporal Logic under the Event-Based Semantics (Full Version)

by   Vladislav Ryzhikov, et al.

We investigate the data complexity of answering queries mediated by metric temporal logic ontologies under the event-based semantics assuming that data instances are finite timed words timestamped with binary fractions. We identify classes of ontology-mediated queries answering which can be done in AC0, NC1, L, NL, P, and coNP for data complexity, provide their rewritings to first-order logic and its extensions with primitive recursion, transitive closure or datalog, and establish lower complexity bounds.


page 1

page 2

page 3

page 4


First-Order Rewritability of Ontology-Mediated Queries in Linear Temporal Logic

We investigate ontology-based data access to temporal data. We consider ...

Temporal Minimal-World Semantics for Sparse ABoxes

Ontology-mediated query answering is a popular paradigm for enriching an...

Temporal Description Logic for Ontology-Based Data Access (Extended Version)

Our aim is to investigate ontology-based data access over temporal data ...

First-Order Rewritability and Complexity of Two-Dimensional Temporal Ontology-Mediated Queries

Aiming at ontology-based data access to temporal data, we design two-dim...

A data complexity and rewritability tetrachotomy of ontology-mediated queries with a covering axiom

Aiming to understand the data complexity of answering conjunctive querie...

Conjunctive Queries for Logic-Based Information Extraction

This thesis offers two logic-based approaches to conjunctive queries in ...

Provenance for the Description Logic ELHr

We address the problem of handling provenance information in ELHr ontolo...