scholarly journals Querying Log Data with Metric Temporal Logic

2018 ◽  
Vol 62 ◽  
pp. 829-877 ◽  
Author(s):  
Sebastian Brandt ◽  
Elem Güzel Kalaycı ◽  
Vladislav Ryzhikov ◽  
Guohui Xiao ◽  
Michael Zakharyaschev

We propose a novel framework for ontology-based access to temporal log data using a datalog extension datalogMTL of the Horn fragment of the metric temporal logic MTL. We show that datalogMTL is EXPSPACE-complete even with punctual intervals, in which case full MTL is known to be undecidable. We also prove that nonrecursive datalogMTL is PSPACE-complete for combined complexity and in AC0 for data complexity. We demonstrate by two real-world use cases that nonrecursive datalogMTL programs can express complex temporal concepts from typical user queries and thereby facilitate access to temporal log data. Our experiments with Siemens turbine data and MesoWest weather data show that datalogMTL ontology-mediated queries are efficient and scale on large datasets.

Author(s):  
Vladislav Ryzhikov ◽  
Przemyslaw Andrzej Walega ◽  
Michael Zakharyaschev

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.


2019 ◽  
Vol 66 (1) ◽  
pp. 7-19
Author(s):  
Stefano Baratella ◽  
Andrea Masini

2005 ◽  
Vol 198 (2) ◽  
pp. 148-178 ◽  
Author(s):  
Yoram Hirshfeld ◽  
Alexander Rabinovich

2006 ◽  
Vol 52 (5) ◽  
pp. 450-456
Author(s):  
Stefano Baratella ◽  
Andrea Masini

Sign in / Sign up

Export Citation Format

Share Document