An Improved Set-based Reasoner for the Description Logic ℒD4,× †.

We present a KE-tableau-based implementation of a reasoner for a decidable fragment of (stratified) set theory expressing the description logic ℒ〈4LQSR,×〉(D) ( ℒ D 4 , × , for short). Our application solves the main TBox and ABox reasoning problems for ℒ D 4 , × . In particular, it solves the consistency and the classification problems for ℒ D 4 , × -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 ℒ D 4 , × -knowledge bases serialized in the OWL/XML format and it admits also rules expressed in SWRL (Semantic Web Rule Language). [ABSTRACT FROM AUTHOR]