An Improved Set-based Reasoner for the Description Logic π’Ÿβ„’D4,׆

Domenico Aldo Cantone, Marianna Nicolosi Asmundo, Daniele Francesco Santamaria Β· Fundamenta Informaticae Β· 2021

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).

Read the paper Β· More papers on PaperTik