Ontology-mediated query answering over temporal and inconsistent data

Tracking #: 1920-3133

Camille Bourgaux
Patrick Koopmann
Anni-Yasmin Turhan

Responsible editor: 
Guest Editors Stream Reasoning 2017

Submission type: 
Full Paper
Stream-based reasoning systems process data stemming from different sources and that are received over time. In this kind of applications, reasoning needs to cope with the temporal dimension and should be resilient against inconsistencies in the data. Motivated by such settings, this paper addresses the problem of handling inconsistent data in a temporal version of ontology-mediated query answering. We consider a recently proposed temporal query language that combines conjunctive queries with operators of propositional linear temporal logic, and consider these under three inconsistency-tolerant semantics that have been introduced for querying inconsistent description logic knowledge bases. We investigate their complexity for EL_bot and DL-Lite_R temporal knowledge bases. In particular, we consider two different cases, depending on the presence of negations in the query. Furthermore, we complete the complexity picture for the consistent case. We also provide two approaches toward practical algorithms for inconsistency-tolerant temporal query answering.
Full PDF Version: 


Solicited Reviews:
Click to Expand/Collapse
Review #1
Anonymous submitted on 05/Aug/2018
Review Comment:

In this revision, the authors have addressed all the comments of my previous review.

A minor issue: references [18] and [54] are the same.

Review #2
Anonymous submitted on 11/Aug/2018
Review Comment:

This manuscript was submitted as 'full paper' and should be reviewed along the usual dimensions for research contributions which include (1) originality, (2) significance of the results, and (3) quality of writing.

The authors have addressed my comments adequately.

As regards the fix of the proof of Proposition 3.5, the argument is perhaps more complicated than necessary for the statement being. The proof establishes that all ${\cal I}_i$ in $\cal J$ have the same domain $\Delta^{{\cal I}'_p}$, which is stronger than that the individual names are rigid. For that, it would be sufficient to assume w.o.l.o.g. that the domains $\Delta^{{\cal I}'_i}$ of models ${\cal I}'_i$ of $\langle {\cal T},{\cal A}_i\rangle$ are pairwise disjoint, and replace each $a^{{\cal I}'_i$ in $\Delta^{{\cal I}'_i}$ by $a^{{\cal I}'_p}$ to obtain $\Delta^{{\cal I}_i}$ and define then ${\cal I}_i in the obvious way.

Note that the co-domain of the mapping m_i should be $2^{\Delta^{{\cal I}'_p}$.