Ontology-mediated query answering over temporal and inconsistent data

Bourgaux, Camille; Koopmann, Patrick; Turhan, Anni-Yasmin

doi:10.3233/sw-180337

Cited by 8 publications

(7 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this context, Borgwardt et al [65,66] study the rewritability properties of LTL-CQs. Bourgaux et al [67] investigate the problem of querying inconsistent data, and Koopmann [68] proposes an extension to probabilistic data.…”

Section: Related Workmentioning

confidence: 99%

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

Artale

Kontchakov

Kovtunova

et al. 2021

Artificial Intelligence

View full text Add to dashboard Cite

Section: Related Workmentioning

confidence: 99%

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

Artale

Kontchakov

Kovtunova

et al. 2021

Artificial Intelligence

View full text Add to dashboard Cite

“…This allows to state that elements in the extension of certain names stay in this extension for at least some specified amount of time. Finally, [Bourgaux et al, 2019] addresses the problem of handling inconsistent data in a temporal version of ontologymediated query answering (based on the combination of conjunctive queries with operators of propositional linear temporal logic). Subsequently, the authors work on temporal knowledge bases.…”

Section: Temporal and Spacial Extensions Of Dlsmentioning

confidence: 99%

Towards World Identification in Description Logics

Badie¹

2023

View full text Add to dashboard Cite

The logical analysis of the usability of nominals, that are introduced by Hybrid Logic, informal descriptions of the world (within modern knowledge representation systems and semantic systems) is very important because nominals, as second sorts of propositional symbols, can support logical identification of the described world at specific states. This paper will focus on answering the philosophical-logical question of ‘how a fundamental world description in the description logic (DL) and a nominal can be related to each other?’. Based on my assumption that nominals can support more adequate identification of the world in DL, this paper will deal with the concept of ‘world identification’. Accordingly, based on a logical-terminological analysis of nominals, it will analyse hybridised fundamental world descriptions. Relying on the outcomes, this research will reach the idea that we can have a hybrid description logic with the analysed concepts.

show abstract

“…Thost (2015a, 2015b) and Baader, Borgwardt, and Lippmann (2015a) analyse the complexity of answering LTL-CQs for weaker ontology languages such as EL (see below) and DL-Lite, while Thost (2013, 2015) study rewritability of LTL-CQs. Bourgaux, Koopmann, and Turhan (2019) investigate the problem of querying inconsistent data, and Koopmann (2019) proposes an extension to probabilistic data. As the monitoring of systems based on data streams is a major application area for these logics, it is of interest to be able to answer queries without storing the whole ABox; for such results on the query language LTL-CQs, we refer the reader to Borgwardt et al (2015).…”

Section: Related Workmentioning

confidence: 99%

First-Order Rewritability and Complexity of Two-Dimensional Temporal Ontology-Mediated Queries

Artale¹,

Kontchakov²,

Kovtunova³

et al. 2022

jair

View full text Add to dashboard Cite

Aiming at ontology-based data access to temporal data, we design two-dimensional temporal ontology and query languages by combining logics from the (extended) DL-Lite family with linear temporal logic LTL over discrete time (Z,<). Our main concern is first-order rewritability of ontology-mediated queries (OMQs) that consist of a 2D ontology and a positive temporal instance query. Our target languages for FO-rewritings are two-sorted FO(<) -- first-order logic with sorts for time instants ordered by the built-in precedence relation < and for the domain of individuals---its extension FO(<, ≡) with the standard congruence predicates t ≡ 0 (mod n), for any fixed n > 1, and FO(RPR) that admits relational primitive recursion. In terms of circuit complexity, FO(<, ≡)- and FO(RPR)-rewritability guarantee answering OMQs in uniform AC0 and NC1, respectively. We proceed in three steps. First, we define a hierarchy of 2D DL-Lite/LTL ontology languages and investigate the FO-rewritability of OMQs with atomic queries by constructing projections onto 1D LTL OMQs and employing recent results on the FO-rewritability of propositional LTL OMQs. As the projections involve deciding consistency of ontologies and data, we also consider the consistency problem for our languages. While the undecidability of consistency for 2D ontology languages with expressive Boolean role inclusions might be expected, we also show that, rather surprisingly, the restriction to Krom and Horn role inclusions leads to decidability (and ExpSpace-completeness), even if one admits full Booleans on concepts. As a final step, we lift some of the rewritability results for atomic OMQs to OMQs with expressive positive temporal instance queries. The lifting results are based on an in-depth study of the canonical models and only concern Horn ontologies.

show abstract

Ontology-mediated query answering over temporal and inconsistent data

Cited by 8 publications

References 34 publications

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

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

Towards World Identification in Description Logics

First-Order Rewritability and Complexity of Two-Dimensional Temporal Ontology-Mediated Queries

Contact Info

Product

Resources

About