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.

翻译：在数据库查询逆向工程中，我们旨在根据给定的答案集与非答案集构造查询；该查询随后可用于进一步探索数据，或作为答案与非答案的解释。我们研究针对时间戳数据上线性时序逻辑LTL正片段公式化查询的"基于示例查询"问题，重点关注合适查询语言的设计，以及判断在给定语言中是否存在能够区分给定答案与非答案的查询的联合复杂度与数据复杂度。我们同时考虑纯LTL查询和由LTL本体中介的查询。