A C++ reasoner for the description logic DLD4,\!× (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 DL 4LQSR,\!×(D) (shortly DLD4,\!×). The reasoner checks the consistency of DLD4,\!×-knowledge bases (KBs) represented in set-theoretic terms. It is implemented in C++ and supports DLD4,\!×-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.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.