We present a KE-tableau-based implementation of a reasoner for a decidable fragment of (stratified) set theory expressing the description logic 𝒟ℒ〈4LQSR,×〉(D) (𝒟ℒD4,×, for short). Our application solves the main TBox and ABox reasoning problems for 𝒟ℒD4,×. In particular, it solves the consistency and the classification problems for 𝒟ℒD4,×-knowledge bases represented in set-theoretic terms, and a generalization of the Conjunctive Query Answering problem in which conjunctive queries with variables of three sorts are admitted. The reasoner, which extends and improves a previous version, is implemented in C++. It supports 𝒟ℒD4,×-knowledge bases serialized in the OWL/XML format and it admits also rules expressed in SWRL (Semantic Web Rule Language).

中文翻译：

---

描述逻辑𝒟ℒD4，×的改进的基于集合的推理器

我们为（分层的）集合理论的可确定片段提供了一种基于推理机的推理机实现，该分层表达了描述逻辑𝒟ℒ〈4LQSR，×〉（D）（简称𝒟ℒD4，×）。我们的应用程序解决了𝒟ℒD4，×的主要TBox和ABox推理问题。特别地，它解决了以集合理论术语表示的𝒟ℒD4，x-知识库的一致性和分类问题，并解决了包含三种变量的联合查询的联合查询应答问题的推广。推理程序扩展和改进了以前的版本，是用C ++实现的。它支持以OWL / XML格式序列化的𝒟ℒD4，×知识库，并且还接受以SWRL（语义Web规则语言）表示的规则。