Status QIO: An Update

We prove co-N2ExpTime-hardness for conjunctive query entailment in the description logic ALCOIF , 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.

• Type: Journal
• Year: 2011
• Where: DLOG
• Authors: Birte Glimm, Yevgeny Kazakov, Carsten Lutz
• Keywords: Automated Reasoning, DLOG 2011, Entailment, Fragment, Upper Bound