Parallel TBox Classification in Description Logics --First Experimental Results

  • Authors:
  • Mina Aslani;Volker Haarslev

  • Affiliations:
  • Concordia University, Montreal, Canada, email: {m_aslani,haarslev}@cse.concordia.ca;Concordia University, Montreal, Canada, email: {m_aslani,haarslev}@cse.concordia.ca

  • Venue:
  • Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
  • Year:
  • 2010

Quantified Score

Hi-index 0.01

Visualization

Abstract

One of the most frequently used inference services of description logic reasoners classifies all named classes of OWL ontologies into a subsumption hierarchy. Due to emerging OWL ontologies from the web community consisting of up to hundreds of thousand of named classes and the increasing availability of multi-processor and multi-or many-core computers, we extend our work on parallel TBox classification and propose a new algorithm that is sound and complete and demonstrates in a first experimental evaluation a low overhead w.r.t. subsumption tests (less than 3%) if compared with sequential classification.