Query Rewriting for Inconsistent DL-Lite Ontologies

Domenico Lembo, Maurizio Lenzerini, Riccardo Rosati, Marco Ruzzi, Domenico Fabio Savo.
In Proceedings of the Fifth International Conference on Web Reasoning and Rule Systems (RR 2011), 2011.



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.

Bibtex entry:

@String{RR-11 = "Proceedings of the Fifth International Conference on Web Reasoning and Rule Systems (RR~2011)"}

author = "Domenico Lembo and Maurizio Lenzerini and Riccardo Rosati and Marco Ruzzi and Domenico Fabio Savo",
title = "Query Rewriting for Inconsistent DL-Lite Ontologies",
booktitle = RR-11,
year = 2011,

Link to electronic version of published paper