Query Rewriting for Inconsistent DL-Lite Ontologies

Abstract

In this paper we study the problem of obtaining meaningful answers to queries posed over inconsistent DL-Lite ontologies. We consider different variants of inconsistency-tolerant semantics and show that for some of such variants answering unions of conjunctive queries (UCQs) is first-order (FOL) rewritable, i.e., it can be reduced to standard evaluation of a FOL/SQL query over a database. Since FOL-rewritability of query answering for UCQs over consistent ontologies under first-order logic semantics is one of the distinguishing features of DL-Lite, in this paper we actually identify some settings in which such property is preserved also under inconsistency-tolerant semantics. We therefore show that in such settings inconsistency-tolerant query answering has the same computational complexity of standard query answering and that it can rely on well-established relational database technology, as under standard DL semantics.

DOI: 10.1007/978-3-642-23580-1_12

Extracted Key Phrases

0510152011201220132014201520162017
Citations per Year

55 Citations

Semantic Scholar estimates that this publication has 55 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Lembo2011QueryRF, title={Query Rewriting for Inconsistent DL-Lite Ontologies}, author={Domenico Lembo and Maurizio Lenzerini and Riccardo Rosati and Marco Ruzzi and Domenico Fabio Savo}, booktitle={RR}, year={2011} }