A \textsf{C++} reasoner for the description logic $\shdlssx$. Article Swipe
Domenico Cantone
,
Marianna Nicolosi Asmundo
,
Daniele Francesco Santamaria
·
YOU?
·
· 2017
· Open Access
·
YOU?
·
· 2017
· Open Access
·
We present an ongoing implementation of a \ke\space based reasoner for a decidable fragment of stratified elementary set theory expressing the description logic $\dlssx$ (shortly $\shdlssx$). The reasoner checks the consistency of $\shdlssx$-knowledge bases (KBs) represented in set-theoretic terms. It is implemented in \textsf{C++} and supports $\shdlssx$-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 represented via a fragment of set theory that can also classify standard OWL ontologies.
Related Topics To Compare & Contrast
Vs
Mathematics
Vs
Semantic Web
Concepts
Semantic reasoner
Description logic
Decidability
Consistency (knowledge bases)
Fragment (logic)
Computer science
Set (abstract data type)
Programming language
XML
Web Ontology Language
Theoretical computer science
Discrete mathematics
Mathematics
Artificial intelligence
Semantic Web
World Wide Web
Metadata
- Type
- preprint
- Language
- en
- Landing Page
- https://arxiv.org/abs/1707.07545v6
- OA Status
- green
- Related Works
- 20
- OpenAlex ID
- https://openalex.org/W2737855517
All OpenAlex metadata
Raw OpenAlex JSON
No additional metadata available.