When Are Description Logic Knowledge Bases Indistinguishable? / 4240
Elena Botoeva, Roman Kontchakov, Vladislav Ryzhikov, Frank Wolter, Michael Zakharyaschev
PDF

Deciding inseparability of description logic knowledge bases (KBs) with respect to conjunctive queries is fundamental for many KB engineering and maintenance tasks including versioning, module extraction, knowledge exchange and forgetting. We study the combined and data complexity of this inseparability problem for fragments of Horn-ALCHI, including the description logics underpinning OWL 2 QL and OWL 2 EL.