Conjunctive queries with negation over DL-Lite: a closer look

Authors:
Víctor Gutiérrez-Basulto;Yazmín Ibañez-García;Roman Kontchakov;Egor V. Kostylev
Affiliations:
Fachbereich Mathematik und Informatik, Universität Bremen, Germany;KRDB Research Centre, Free University of Bozen-Bolzano, Italy;Dept. of Computer Science and Inf. Systems, Birkbeck, University of London, UK;School of Informatics, University of Edinburgh, UK
Venue:
RR'13 Proceedings of the 7th international conference on Web Reasoning and Rule Systems
Year:
2013

Citing 6
Cited 0

The complexity of relational query languages (Extended Abstract)

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family

Journal of Automated Reasoning
The chase revisited

Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The DL-lite family and relations

Journal of Artificial Intelligence Research
The limits of querying ontologies

ICDT'07 Proceedings of the 11th international conference on Database Theory
An update on query answering with restricted forms of negation

RR'12 Proceedings of the 6th international conference on Web Reasoning and Rule Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

While conjunctive query (CQ) answering over DL-Lite has been studied extensively, there have been few attempts to analyse CQs with negated atoms. This paper deepens the study of the problem. Answering CQs with safe negation and CQs with a single inequality over DL-Lite with role inclusions is shown to be undecidable, even for a fixed TBox and query.Without role inclusions, answering CQs with one inequality is P-hard and with two inequalities coNP-hard in data complexity.