When Are Description Logic Knowledge Bases Indistinguishable?
Botoeva, Elena (Free University of Bozen-Bolzano) | Kontchakov, Roman (Birkbeck, University of London) | Ryzhikov, Vladislav (Free University of Bozen-Bolzano) | Wolter, Frank (University of Liverpool) | Zakharyaschev, Michael (Birkbeck, University of London)
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.
Jul-15-2015
- Country:
- Europe
- Italy (0.04)
- United Kingdom > England
- Greater London > London (0.04)
- Merseyside > Liverpool (0.04)
- Europe
- Industry:
- Technology: