First-order rewritability of ontology-mediated queries in linear temporal logic

Artale, Alessandro; Kontchakov, Roman; Kovtunova, Alisa; Ryzhikov, Vladislav; Wolter, Frank; Zakharyaschev, Michael

doi:10.1016/j.artint.2021.103536

Cited by 18 publications

(55 citation statements)

References 79 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The results obtained in this paper can be used for deciding the rewritability type of ontology-mediated queries (OMQs) formulated in linear temporal logic LTL and its extensions [1,2]. As mentioned in the introduction, LTL OMQs can be simulated by automata.…”

Section: Further Researchmentioning

confidence: 99%

“…Our interest in the exact complexity of these problems is motivated by recent advances in ontology-based data access (OBDA) with linear time temporal logic LTL [1,2]. The classical (atemporal) OBDA paradigm [20,29] relies on a reduction of answering a query mediated by an ontology under the open-world semantics to evaluating a database query in a standard language such as SQL or its extension-that is, essentially, an extension of first-order logic-under the closed-world semantic.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Deciding FO-definability of regular languages

Kurucz¹,

Ryzhikov²,

Savateev³

et al. 2021

Preprint

Self Cite

View full text Add to dashboard Cite

We prove that, similarly to known PSpace-completeness of recognising FO(<)-definability of the language L(A) of a DFA A, deciding both FO(<, ≡)-and FO(<, MOD)-definability (corresponding to circuit complexity in AC 0 and ACC 0 ) are PSpace-complete. We obtain these results by first showing that known algebraic characterisations of FOdefinability of L(A) can be captured by 'localisable' properties of the transition monoid of A. Using our criterion, we then generalise the known proof of PSpace-hardness of FO(<)-definability, and establish the upper bounds not only for arbitrary DFAs but also for 2NFAs.

show abstract

Section: Further Researchmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Deciding FO-definability of regular languages

Kurucz¹,

Ryzhikov²,

Savateev³

et al. 2021

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…Moreover, as in this article, the research (Borgwardt et al 2013;Borgwardt et al 2015) focuses on the rewritability properties of LTL-CQs. An orthogonal approach for query rewriting over a temporalized DL-Lite ontology was proposed in (Artale et al 2013;Artale et al 2015). Here the focus mainly lies on increasing expressivity of an ontology language by allowing a concept or a role to be prefixed with LTL constructs.…”

Section: Related Workmentioning

confidence: 99%

“…The threshold n allows to distinguish the case where two mentions of CD4Above250 are years apart, and are therefore unrelated. Reasoning in T ELH c ,lhs,− is tractable in data complexity, because -operators are only allowed on the left-hand side of concept inclusions , which is also common for temporal DLs based on DL-Lite (Artale et al 2013;Artale et al 2015).…”

Section: Introductionmentioning

confidence: 99%

“…By extending our combined rewriting approach, we show that the data complexity of temporal query answering is not higher than for (positive) atemporal queries in ELH , and also provide a tight combined complexity result of ExpSpace. Unlike most research on temporal query answering (Baader et al 2015b;Artale et al 2015), we do not assume that input data is given for all time points in a certain interval, but rather at sporadic time points with arbitrarily large gaps (Brandt et al 2018). The main technical difficulty is to determine which additional time points are relevant for answering a query, and how to access these time points without having to fill infinitely many gaps.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Finding New Diamonds: Temporal Minimal-World Query Answering over Sparse ABoxes

Borgwardt

Forkel

Kovtunova

2019

Rules and Reasoning

Self Cite

View full text Add to dashboard Cite

Ontology-mediated query answering is a popular paradigm for enriching answers to user queries with background knowledge. For querying the absence of information, however, there exist only few ontology-based approaches. Moreover, these proposals conflate the closed-domain and closedworld assumption, and therefore are not suited to deal with the anonymous objects that are common in ontological reasoning. Many real-world applications, like processing electronic health records (EHRs), also contain a temporal dimension, and require efficient reasoning algorithms. Moreover, since medical data is not recorded on a regular basis, reasoners must deal with sparse data with potentially large temporal gaps.Our contribution consists of two main parts: In the first part we introduce a new closed-world semantics for answering conjunctive queries with negation over ontologies formulated in the description logic ELH , which is based on the minimal canonical model. We propose a rewriting strategy for dealing with negated query atoms, which shows that query answering is possible in polynomial time in data complexity. In the second part, we extend this minimal-world semantics for answering metric temporal conjunctive queries with negation over the lightweight temporal logic T ELH c ,lhs,− and obtain similar rewritability and complexity results. This paper is under consideration in Theory and Practice of Logic Programming (TPLP).

show abstract