SCTR (Scalable Constant Time Reasoner)

Disclaimer

The current release is an alpha release.

Acknowledgements

Special thanks to Dr. Vasant Honarvar and Neeraj Koul for the inspiration towards this project.

Towards Scalable Constant Time Reasoning Over Partial Order Ontology with Mappings

Abstract

Ontology is increasingly popular among researchers and the industry. One of the challenges is to build efficient reasoners that can run in constant or near constant time and can scale easily. We present an approach that uses a relational database as a store to pre-compute the closure of the knowledge base in partial order ontology, consequently improving the reasoning efficiency.

Approach

We propose to address the problem by storing the knowledge base in ontology, mappings in a relational database. The basic idea is to save all the knowledge present in the ontology in the form of relational tuples in the database. By all knowledge, we mean to store all the concepts, axioms, and the closure of the axioms in the database as tuples.

Architecture