We present an ongoing implementation of a KE-Tableau based reasoner for a decidable fragment of stratified elementary set theory expressing the description logic DLh4LQSR;Ãi(D) (shortly DL4;ÃD). The reasoner checks the consistency of DL4;ÃD-knowledge bases (KBs) repre-sented in set-Theoretic terms. It is implemented in C++ and supports DL4;ÃD-KBs serialized in the OWL/XML format. To the best of our knowledge, this is the first attempt to implement a reasoner for the consistency checking of a description logic that is represented via a fragment of set theory that can also classify standard OWL ontologies.
A C++ reasoner for the description logic DL4;× D?
Cantone, Domenico
;Nicolosi-asmundo, Marianna
;Santamaria, Daniele Francesco
2017-01-01
Abstract
We present an ongoing implementation of a KE-Tableau based reasoner for a decidable fragment of stratified elementary set theory expressing the description logic DLh4LQSR;Ãi(D) (shortly DL4;ÃD). The reasoner checks the consistency of DL4;ÃD-knowledge bases (KBs) repre-sented in set-Theoretic terms. It is implemented in C++ and supports DL4;ÃD-KBs serialized in the OWL/XML format. To the best of our knowledge, this is the first attempt to implement a reasoner for the consistency checking of a description logic that is represented via a fragment of set theory that can also classify standard OWL ontologies.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
CILCpaper03.pdf
accesso aperto
Descrizione: Articolo principale
Tipologia:
Versione Editoriale (PDF)
Dimensione
299.82 kB
Formato
Adobe PDF
|
299.82 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
