We present a KE-tableau-based implementation of a reasoner for a decidable fragment of (stratified) set theory expressing the description logic (D) (4,×, for short). Our application solves the main TBox and ABox reasoning problems for 4,×. In particular, it solves the consistency and the classification problems for 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 4,×-knowledge bases serialized in the OWL/XML format and it admits also rules expressed in SWRL (Semantic Web Rule Language).
An Improved Set-based Reasoner for the Description Logic 4,×
Cantone D.;Nicolosi-Asmundo M.;Santamaria D. F.
2021-01-01
Abstract
We present a KE-tableau-based implementation of a reasoner for a decidable fragment of (stratified) set theory expressing the description logic (D) (4,×, for short). Our application solves the main TBox and ABox reasoning problems for 4,×. In particular, it solves the consistency and the classification problems for 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 4,×-knowledge bases serialized in the OWL/XML format and it admits also rules expressed in SWRL (Semantic Web Rule Language).I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
