Reverse Engineering of Temporal Queries with and without LTL Ontologies: First Steps: Extended Abstract

Marie Fortin; Boris Konev; Vladislav Ryzhikov; Yury Savateev; Frank Wolter; Michael Zakharyaschev

Reverse Engineering of Temporal Queries with and without LTL Ontologies: First Steps: Extended Abstract

Marie Fortin, Boris Konev, Vladislav Ryzhikov, Yury Savateev, Frank Wolter, Michael Zakharyaschev

Research output: Contribution to conference › Paper › peer-review

Abstract

In reverse engineering of database queries, one aims to construct a query from a set of positively and negatively labelled answers and non-answers. The query can then be used to explore the data further or as an explanation of the answers and non-answers. We consider this reverse engineering problem for queries formulated in various fragments of positive linear temporal logic LTL over data instances given by timestamped atomic concepts. We focus on the design of suitable query languages and the complexity of the separability problem: ‘does there exist a query in the given query language that separates the given answers from the non-answers?’. We deal with both plain LTL queries and those that are mediated by ontologies providing background knowledge and formulated in fragments of clausal LTL.

Original language	English
Publication status	Published - 2022
Event	35th International Workshop on Description Logics, - Haifa, Israel Duration: 7 Aug 2022 → 10 Aug 2022 Conference number: 35 https://dai.fmph.uniba.sk/events/dl2022/

Conference

Conference	35th International Workshop on Description Logics,
Abbreviated title	DL 2022
Country/Territory	Israel
City	Haifa
Period	7/08/22 → 10/08/22
Internet address	https://dai.fmph.uniba.sk/events/dl2022/

Keywords

Reverse engineering of queries
query-by-example
Explanation
linear temporal logic
ontology-mediated query
computational complexity

Access to Document

https://ceur-ws.org/Vol-3263/abstract-8.pdf

Cite this

@conference{c194a71a15d54ed1b3aa809e25617dca,

title = "Reverse Engineering of Temporal Queries with and without LTL Ontologies: First Steps: Extended Abstract",

abstract = "In reverse engineering of database queries, one aims to construct a query from a set of positively and negatively labelled answers and non-answers. The query can then be used to explore the data further or as an explanation of the answers and non-answers. We consider this reverse engineering problem for queries formulated in various fragments of positive linear temporal logic LTL over data instances given by timestamped atomic concepts. We focus on the design of suitable query languages and the complexity of the separability problem: {\textquoteleft}does there exist a query in the given query language that separates the given answers from the non-answers?{\textquoteright}. We deal with both plain LTL queries and those that are mediated by ontologies providing background knowledge and formulated in fragments of clausal LTL.",

keywords = "Reverse engineering of queries, query-by-example, Explanation, linear temporal logic, ontology-mediated query, computational complexity",

author = "Marie Fortin and Boris Konev and Vladislav Ryzhikov and Yury Savateev and Frank Wolter and Michael Zakharyaschev",

year = "2022",

language = "English",

note = "35th International Workshop on Description Logics,, DL 2022 ; Conference date: 07-08-2022 Through 10-08-2022",

url = "https://dai.fmph.uniba.sk/events/dl2022/",

}

TY - CONF

T1 - Reverse Engineering of Temporal Queries with and without LTL Ontologies: First Steps

T2 - 35th International Workshop on Description Logics,

AU - Fortin, Marie

AU - Konev, Boris

AU - Ryzhikov, Vladislav

AU - Savateev, Yury

AU - Wolter, Frank

AU - Zakharyaschev, Michael

N1 - Conference code: 35

PY - 2022

Y1 - 2022

N2 - In reverse engineering of database queries, one aims to construct a query from a set of positively and negatively labelled answers and non-answers. The query can then be used to explore the data further or as an explanation of the answers and non-answers. We consider this reverse engineering problem for queries formulated in various fragments of positive linear temporal logic LTL over data instances given by timestamped atomic concepts. We focus on the design of suitable query languages and the complexity of the separability problem: ‘does there exist a query in the given query language that separates the given answers from the non-answers?’. We deal with both plain LTL queries and those that are mediated by ontologies providing background knowledge and formulated in fragments of clausal LTL.

AB - In reverse engineering of database queries, one aims to construct a query from a set of positively and negatively labelled answers and non-answers. The query can then be used to explore the data further or as an explanation of the answers and non-answers. We consider this reverse engineering problem for queries formulated in various fragments of positive linear temporal logic LTL over data instances given by timestamped atomic concepts. We focus on the design of suitable query languages and the complexity of the separability problem: ‘does there exist a query in the given query language that separates the given answers from the non-answers?’. We deal with both plain LTL queries and those that are mediated by ontologies providing background knowledge and formulated in fragments of clausal LTL.

KW - Reverse engineering of queries

KW - query-by-example

KW - Explanation

KW - linear temporal logic

KW - ontology-mediated query

KW - computational complexity

M3 - Paper

Y2 - 7 August 2022 through 10 August 2022

ER -

Reverse Engineering of Temporal Queries with and without LTL Ontologies: First Steps: Extended Abstract

Abstract

Conference

Keywords

Access to Document

Fingerprint

Cite this