An update on query answering with restricted forms of negation
Gutiérrez-Basulto, V. and Ibáñez-García, Y. and Kontchakov, Roman (2012) An update on query answering with restricted forms of negation. In: Krotzsch, M. and Straccia, U. (eds.) Web Reasoning and Rule Systems. Lecture Notes in Computer Science 7497. Berlin, Germany: Springer, pp. 75-89. ISBN 9783642332029.
One of the most prominent applications of description logic ontologies is their use for accessing data. In this setting, ontologies provide an abstract conceptual layer of the data schema, and queries over the ontology are then used to access the data. In this paper we focus on extensions of conjunctive queries (CQs) and unions of conjunctive queries (UCQs) with restricted forms of negations such as inequality and safe negation. In particular, we consider ontologies based on members of the DL-Lite family. We show that by extending UCQs with any form of negated atoms, the problem of query answering becomes undecidable even when considering ontologies expressed in the core fragment of DL-Lite. On the other hand, we show that answering CQs with inequalities is decidable for ontologies expressed in DL-Lite^H_core. To this end, we provide an algorithm matching the known CONP lower bound on data complexity. Furthermore, we identify a setting in which conjunctive query answering with inequalities is tractable. We regain tractability by means of syntactic restrictions on the queries, but keeping the expressiveness of the ontology.
|Item Type:||Book Section|
|Additional Information:||6th International Conference, RR 2012, Vienna, Austria, September 10-12, 2012. Proceedings|
|School:||Birkbeck Schools and Departments > School of Business, Economics & Informatics > Computer Science and Information Systems|
|Depositing User:||Roman Kontchakov|
|Date Deposited:||07 Dec 2012 09:37|
|Last Modified:||11 Oct 2016 12:02|
Additional statistics are available via IRStats2.