First-Order Rewritability of Temporal Ontology-Mediated Queries

Artale, Alessandro (Free University of Bozen-Bolzano) | Kontchakov, Roman (Birkbeck, University of London) | Kovtunova, Alisa (Free University of Bozen-Bolzano) | Ryzhikov, Vladislav (Free University of Bozen-Bolzano) | Wolter, Frank (University of Liverpool) | Zakharyaschev, Michael (Birkbeck, University of London)

AAAI Conferences 

Baader et al., 2013; Borgwardt et al., 2013; Özcep et al., 2013; Klarman and Meyer, 2014] and shown to preserve query Aiming at ontology-based data access over temporal, rewritability. Note, however, that the inability to define temporal in particular streaming data, we design a language of predicates such as Blizzard(x, t) in ontologies leaves the ontology-mediated queries by extending OWL 2 QL burden of encoding them within queries to the user, which and SPARQL with temporal operators, and investigate goes against the OBDA paradigm. Moreover, natural queries rewritability of these queries into two-sorted such as'check if a weather station has been serviced every 24 first-order logic with and PLUS over time.

Duplicate Docs Excel Report

Title
None found

Similar Docs  Excel Report  more

TitleSimilaritySource
None found