Inconsistency-tolerant temporal query answering in lightweight description logics
In ontology-based systems that process data from different sources and that is received over time, as in context-aware systems, reasoning needs to cope with the temporal dimension and should be resilient against inconsistencies in the data. Motivated by such settings, we address the problem of handling inconsistent data in a temporal version of ontology-based query answering (OBQA). We consider in this talk a temporal query language that combines conjunctive queries with operators of propositional linear temporal logic and extend this setting to three inconsistency-tolerant semantics that have been introduced for querying inconsistent description logic knowledge bases. We investigate their complexity for temporal knowledge bases expressed in lightweight Description Logics.