Efficient TBox Subsumption Checking in Combinations of EL and (fragments of) FL0

Abstract

We study possibilities of combining (fragments) of the lightweight description logics FL0 and EL, and identify classes of subsumption problems in a combination of EL and Horn-FL0, which can be checked in PSPACE resp. PTIME. Since FL0 allows universal role restrictions and EL allows existential role restrictions, we thus have a framework where subsumption between expressions including both types of role restrictions (but for disjoint sets of roles) can be checked in polynomial space or time.

Extracted Key Phrases

2 Figures and Tables

Cite this paper

@inproceedings{Gasse2011EfficientTS, title={Efficient TBox Subsumption Checking in Combinations of EL and (fragments of) FL0}, author={Francis Gasse and Viorica Sofronie-Stokkermans}, booktitle={Description Logics}, year={2011} }