Reverse Engineering of Temporal Queries Mediated by LTL Ontologies

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

doi:10.24963/ijcai.2023/360

Reverse Engineering of Temporal Queries Mediated by LTL Ontologies

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

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

6 Citations (Scopus)

Abstract

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.

Original language	English
Pages	3230-3238
DOIs	https://doi.org/10.24963/ijcai.2023/360
Publication status	Published - 2023
Event	Thirty-Second International Joint Conference on Artificial Intelligence - Macao Duration: 19 Aug 2023 → 23 Aug 2023 Conference number: 32 https://ijcai-23.org/

Conference

Conference	Thirty-Second International Joint Conference on Artificial Intelligence
Abbreviated title	IJCAI'23
City	Macao
Period	19/08/23 → 23/08/23
Internet address	https://ijcai-23.org/

Access to Document

10.24963/ijcai.2023/360

Cite this

@conference{d55b7f48ca224178b0f79b1e336170e4,

title = "Reverse Engineering of Temporal Queries Mediated by LTL Ontologies",

abstract = "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.",

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

year = "2023",

doi = "10.24963/ijcai.2023/360",

language = "English",

pages = "3230--3238",

note = "Thirty-Second International Joint Conference on Artificial Intelligence, IJCAI'23 ; Conference date: 19-08-2023 Through 23-08-2023",

url = "https://ijcai-23.org/",

}

TY - CONF

T1 - Reverse Engineering of Temporal Queries Mediated by LTL Ontologies

AU - Fortin, Marie

AU - Konev, Boris

AU - Ryzhikov, Vladislav

AU - Savateev, Yury

AU - Wolter, Frank

AU - Zakharyaschev, Michael

N1 - Conference code: 32

PY - 2023

Y1 - 2023

N2 - 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.

AB - 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.

U2 - 10.24963/ijcai.2023/360

DO - 10.24963/ijcai.2023/360

M3 - Paper

SP - 3230

EP - 3238

T2 - Thirty-Second International Joint Conference on Artificial Intelligence

Y2 - 19 August 2023 through 23 August 2023

ER -

Reverse Engineering of Temporal Queries Mediated by LTL Ontologies

Abstract

Conference

Access to Document

Fingerprint

Cite this