  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.
