Inconsistency-Tolerant Conjunctive Query Answering for Simple Ontologies

Fragment of Datalog+/– Cons ICons ICR guarded (Theorem 9) co-NP-complete [22] co-NP-complete [22] co-NP-complete linear (Theorem 10) co-NP-complete [22] FO-rewritable

Consistent query answering (CQA) is about formally char- acterizing and computing semantically correct answers to queries posed to a database that may fail to satisfy certain

We present a query processing procedure for conjunctive queries in distributed ontology systems where a large ontology is di- vided into ontology fragments that are later

We consider DL-Lite N horn , the most expressive dialect of DL-Lite that does not include role inclusions and for which query answering is in AC 0 for data complexity; for relations

An important result of these works is that the main variants of DL-Lite are not only decidable, but that answering (unions of) conjunctive queries for these logics is in LOGSPACE ,

On the other hand, dimension in Figure 2 is not strict since now element N 3 rolls-up to both IX and VIII in category Region which shows that the data is not accurate and also

In contrast to OWL2-EL, the design goal of both OWL2-QL and OWL2-RL is to enable the use of database technology for query answering over OWL in- stance data: many applications

In this paper, we show that, in SHIQ without inverse roles (and with- out transitive roles in the query), conjunctive query answering is only ExpTime -complete and thus not harder