Reverse Engineering of Temporal Queries Mediated by LTL Ontologies

05/02/2023
by   Marie Fortin, et al.
0

In reverse engineering of database queries, we aim to construct a query from a given set of answers and non-answers; it can then be used to explore the data further or as an explanation of the answers and non-answers. We investigate this query-by-example problem for queries formulated in positive fragments of linear temporal logic LTL over timestamped data, focusing on the design of suitable query languages and the combined and data complexity of deciding whether there exists a query in the given language that separates the given answers from non-answers. We consider both plain LTL queries and those mediated by LTL-ontologies.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/08/2016

The Data Complexity of Description Logic Ontologies

We analyze the data complexity of ontology-mediated querying where the o...
research
01/21/2023

Diversity of Answers to Conjunctive Queries

Enumeration problems aim at outputting, without repetition, the set of s...
research
05/23/2019

Hypothetical answers to continuous queries over data streams

Continuous queries over data streams may suffer from blocking operations...
research
05/14/2023

Traceable mixnets

We introduce the notion of traceable mixnets. In a traditional mixnet, m...
research
07/22/2022

CQE in OWL 2 QL: A "Longest Honeymoon" Approach (extended version)

Controlled Query Evaluation (CQE) has been recently studied in the conte...
research
08/25/2020

On the complexity of query containment and computing certain answers in the presence of ACs

We often add arithmetic to extend the expressiveness of query languages ...
research
06/27/2023

A fine-grained framework for database repairs

We introduce a general abstract framework for database repairing that di...

Please sign up or login with your details

Forgot password? Click here to reset