A set-based reasoner for the description logic (Extended Version)

05/18/2018
by   Domenico Cantone, et al.
0

We present a -based implementation of a reasoner for a decidable fragment of (stratified) set theory expressing the description logic (, for short). Our application solves the main TBox and ABox reasoning problems for . In particular, it solves the consistency problem for -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 optimizes a previous prototype for the consistency checking of -knowledge bases (see cilc17), is implemented in C++. It supports -knowledge bases serialized in the OWL/XML format, and it admits also rules expressed in SWRL (Semantic Web Rule Language).

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset