Conference item
Status QIO: An Update
- Abstract:
- We prove that conjunctive query answering in the description logic ALCOIF is co-N2ExpTime-hard, thus improving the previously known 2ExpTime lower bound. The result transfers to OWL DL and OWL2 DL, of which ALCOIF is an important fragment. A matching upper bound remains open.
Actions
Access Document
- Files:
-
-
(Preview, pdf, 180.9KB, Terms of use)
-
- Publisher copy:
- http://ceur-ws.org/Vol-745/paper_44.pdf
Authors
- Publisher:
- CEUR−WS.org
- Host title:
- Description Logics
- Volume:
- 745
- Publication date:
- 2011-01-01
- DOI:
- UUID:
-
uuid:60492d86-f39e-4801-9c20-a7b48a419cba
- Local pid:
-
cs:5192
- Deposit date:
-
2015-03-31
- ARK identifier:
Terms of use
- Copyright date:
- 2011
If you are the owner of this record, you can report an update to it here: Report update to this record