Complete OWL-DL Reasoning Using Relational Databases

  • Authors:
  • Maria Mar Roldan-Garcia;Jose F. Aldana-Montes

  • Affiliations:
  • Departamento de Lenguajes y Ciencias de la Computacion, University of Malaga, Malaga, Spain 29071;Departamento de Lenguajes y Ciencias de la Computacion, University of Malaga, Malaga, Spain 29071

  • Venue:
  • DEXA '09 Proceedings of the 20th International Conference on Database and Expert Systems Applications
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Real Semantic Web applications, such as biological tools, use large ontologies, that is, ontologies with a large number (millions) of instances. Due to the increasing development of such applications, it is necessary to provide scalable and efficient ontology querying and reasoning systems. DBOWL is a Persistent and Scalable OWL reasoner which stores ontologies and implements reasoning using a relational database. In this paper we present an extension of DBOWL that implements all inference rules for OWL-DL. Furthermore, we describe briefly the reasoning algorithms and their completeness proofs.