Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
129 tokens/sec
GPT-4o
28 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

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

Published 21 Jul 2017 in cs.LO

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{DL}\langle \mathsf{4LQS{R,!\times}}\rangle(\mathbf{D})$ (shortly $\mathcal{DL}{\mathbf{D}}{4,!\times}$). The reasoner checks the consistency of $\mathcal{DL}{\mathbf{D}}{4,!\times}$-knowledge bases (KBs) represented in set-theoretic terms. It is implemented in \textsf{C++} and supports $\mathcal{DL}_{\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.

Citations (2)

Summary

We haven't generated a summary for this paper yet.