Explaining Subsumption in ALEHF_R⁺ TBoxes

This paper presents current work on generating textual explanations for subsumption within an expressive fraction of OWL Lite TBoxes. Our approach is based on a tableau-style algorithm. We describe how to explain subsumptions within ALE extended by role hierarchies, transitivity, cardinality restrictions, and domain as well as range restrictions. We also illustrate some optimization features, comment on our implementation, and discuss future extensions concerning more expressive languages.

Online Copy

Paper is available as PDF (126 KB)

BibTeX Entry

@InProceedings{Liebig05:_explain_subsumption, author = "Thorsten Liebig and Michael Halfmann", title = "{Explaining Subsumption in $\mathcal{ALEHF}_{R^+}$ TBoxes}", year = 2005, booktitle = "Proc. of the 2005 International Workshop on Description Logics - DL2005", pages = {144--151}, editor = "Ian Horrocks and Ulricke Sattler and Frank Wolter", address = "Edinburgh, Scotland", month = "July" }