Conference item icon

Conference item

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

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. © 2013 Springer-Verlag.
Publication status:
Published
Version:
Accepted Manuscript

Actions


Access Document


Files:
Publisher copy:
10.1007/978-3-642-39666-3_9

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS Division
Department:
Computer Science
Role:
Author
ORCID:
0000-0002-8886-6129
More from this funder
Grant:
EP/J017728/1 (SOCIAM project)
Publisher:
Springer Publisher's website
Series:
Lecture Notes in Computer Science
Publication date:
2013-08-12
DOI:
ISSN:
0302-9743
Pubs id:
pubs:550203
URN:
uri:164c9a14-ac75-416e-9ffe-ecaffbb657bb
UUID:
uuid:164c9a14-ac75-416e-9ffe-ecaffbb657bb
Local pid:
pubs:550203
ISBN:
9783642396656
Keywords:

Terms of use


Metrics


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP