Implementing an Inference Engine for RDFS/OWL Constructs and User-Defined Rules in Oracle

This inference engines are an integral part of semantic data stores. In this paper, we describe our experience of implementing a scalable inference engine for Oracle semantic data store. This inference engine computes production rule based entailment of one or more RDFS/OWL encoded semantic data models. The inference engine capabilities include (i) inferencing based on semantics of RDFS/OWL constructs and user-defined rules, (ii) computing ancillary information (namely, semantic distance and proof) for inferred triples, and (iii) validation of semantic data model based on RDFS/OWL semantics. A unique aspect of our approach is that the inference engine is implemented entirely as a database application on top of Oracle database. The paper describes the inferencing requirements, challenges in supporting a sufficiently expressive set of RDFS/OWL constructs, and techniques adopted to build a scalable inference engine. A performance study conducted using both native and synthesized semantic datasets demonstrates the effectiveness of our approach.

[1]  James A. Hendler,et al.  A Survey of the Web Ontology Landscape , 2006, SEMWEB.

[2]  Tao Liu,et al.  RStar: an RDF storage and query system for enterprise resource management , 2004, CIKM '04.

[3]  Yannis E. Ioannidis,et al.  On the Computation of the Transitive Closure of Relational Operators , 1986, VLDB.

[4]  Kotagiri Ramamohanarao,et al.  Incremental maintenance of shortest distance and transitive closure in first-order logic and SQL , 2005, TODS.

[5]  Ian Horrocks,et al.  A Tableaux Decision Procedure for SHOIQ , 2005, IJCAI.

[6]  Boris Motik,et al.  Reasoning in Description Logics by a Reduction to Disjunctive Datalog , 2007, Journal of Automated Reasoning.

[7]  Diego Calvanese,et al.  DL-Lite: Tractable Description Logics for Ontologies , 2005, AAAI.

[8]  Heiner Stuckenschmidt,et al.  Time - Space Trade-Offs in Scaling up RDF Schema Reasoning , 2005, WISE Workshops.

[9]  H. V. Jagadish,et al.  Direct Algorithms for Computing the Transitive Closure of Database Relations , 1987, VLDB.

[10]  Franz Baader,et al.  CEL - A Polynomial-Time Reasoner for Life Science Ontologies , 2006, IJCAR.

[11]  Frank van Harmelen,et al.  Sesame: A Generic Architecture for Storing and Querying RDF and RDF Schema , 2002, SEMWEB.

[12]  Jianwen Su,et al.  Maintaining Transitive Closure of Graphs in SQL , 1999 .

[13]  Dave Reynolds,et al.  Efficient RDF Storage and Retrieval in Jena2 , 2003, SWDB.

[14]  Ian Horrocks,et al.  Description logic programs: combining logic programs with description logic , 2003, WWW '03.

[15]  Wendy Hall,et al.  The Semantic Web Revisited , 2006, IEEE Intelligent Systems.

[16]  Ulf Leser,et al.  Fast and practical indexing and querying of very large graphs , 2007, SIGMOD '07.

[17]  Herman J. ter Horst,et al.  Completeness, decidability and complexity of entailment for RDF Schema and a semantic extension involving the OWL vocabulary , 2005, J. Web Semant..

[18]  Atanas Kiryakov,et al.  OWLIM - A Pragmatic Semantic Repository for OWL , 2005, WISE Workshops.

[19]  I. Horrocks,et al.  A Tableau Decision Procedure for $\mathcal{SHOIQ}$ , 2007, Journal of Automated Reasoning.