Conference item : Conference-proceeding
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
Actions
Access Document
- Files:
-
-
(Accepted manuscript, pdf, 296.4KB)
-
- Publisher copy:
- 10.1007/978-3-642-39666-3_9
Authors
Funding
Bibliographic Details
- Publisher:
- Springer Publisher's website
- Journal:
- Lecture Notes in Computer Science - International Conference on Web Reasoning and Rule Systems Journal website
- Series:
- Lecture Notes in Computer Science
- Host title:
- 7th International Conference on Web Reasoning and Rule Systems 2013
- Publication date:
- 2013-08-12
- DOI:
- ISSN:
-
0302-9743
- Source identifiers:
-
550203
- ISBN:
- 9783642396656
Item Description
- Keywords:
- Subtype:
- conference-proceeding
- Pubs id:
-
pubs:550203
- UUID:
-
uuid:164c9a14-ac75-416e-9ffe-ecaffbb657bb
- Local pid:
- pubs:550203
- Deposit date:
- 2016-12-10
Terms of use
- Copyright holder:
- ©Springer-Verlag Berlin Heidelberg 2013
- Copyright date:
- 2013
- Notes:
- This is the author accepted manuscript version of the article. The final version is available online from Springer at: https://doi.org/10.1007/978-3-642-39666-3_9
If you are the owner of this record, you can report an update to it here: Report update to this record