A C++ reasoner for the description logic ${\mathcal{D}\mathcal{L}}_{\mathbf{D}}^{4,\times }$ (Extended Version)

Abstract

We present an ongoing implementation of a KE-tableau based reasoner for a decidable fragment of stratified elementary set theory expressing the description logic $\mathcal{D}\mathcal{L}⟨4LQ{\mathsf{S}}^{\mathsf{R},\times }⟩(\mathbf{D})$ (shortly ${\mathcal{D}\mathcal{L}}_{\mathbf{D}}^{4,\times }$). The reasoner checks the consistency of ${\mathcal{D}\mathcal{L}}_{\mathbf{D}}^{4,\times }$-knowledge bases (KBs) represented in set-theoretic terms. It is implemented in \textsf{C++} and supports ${\mathcal{D}\mathcal{L}}_{\mathbf{D}}^{4,\times }$-KBs serialized in the OWL/XML format. To the best of our knowledge, this is the first attempt to implement a reasoner for the consistency checking of a description logic represented via a fragment of set theory that can also classify standard OWL ontologies.

Please cite https://www.scopus.com/record/display.uri?eid=2-s2.0-85031922356&origin=resultslist. arXiv admin note: text overlap with arXiv:1702.03096