Effi cient Inferencing for the Description Logic Underlying OWL EL
Markus Krötzsch · 2010
The recent OWL 2 W3C recommendation includes the lightweight ontology language OWL EL which is semantically based on an extension of the EL ++ description logic (DL). It is widely assumed that inferenci ng in OWL EL is possible in polynomial time, but it is not obvious how to extend existing rea- soning procedures forEL ++ accordingly. We set out to close this gap by devel- oping inferencing methods forSROEL(u;� ) - a DL that subsumes the main features of OWL EL. We present a framework for studying materialisation cal- culi based on datalog, and we use it to investigate the resource requirements for inferencing. We can show that certainSROEL(u;� ) feature combinations must lead to increased space upper bounds in any materialisation calculus, suggesting that effi cient implementations are easier to obtain for suitably chosen fragments ofSROEL(u;� ).