Design and Implementation of an Efficient Semantic Web Reasoner (original) (raw)
We present an extended version of the CEDAR taxonomic reasoner for large-scale ontologies. This new version provides fuller support for TBox reasoning, checking consistency, and retrieving instances. The CEDAR system is based upon the OSF formalism. It is implemented on an entirely new architecture which includes several optimization techniques. We define a bidirectional map-ping between OSF graph structures and the Resource Description Framework (RDF) allowing a translation from OSF queries into SPARQL for retrieving instances from an ABox consisting of an RDF triplestore. We carried out comparative performance evaluation experiments using CEDAR as well as well-known Semantic Web reasoners (such as FaCT++, Pellet, HermiT, TrO WL, and RacerPro) on very large public ontologies. For the same queries on the same ontologies, the results achieved by CEDAR were compared to those obtained by all the other reasoners. The results of experiments show that CEDAR consistently performs on a par ...
Sign up for access to the world's latest research.
checkGet notified about relevant papers
checkSave papers to use in your research
checkJoin the discussion with peers
checkTrack your impact
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.