Parallel TBox Classification in Description Logics - First Experimental Results

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. 1 Motivation Due to the recent popularity of OWL ontologies in the web one can observe a trend toward the development of very large or huge OWLDL ontologies. For instance, well known examples from the bioinformatics or medical community are SNOMED, UMLS, GALEN, or FMA. Some (versions) of these ontologies consist of more than hundreds of thousands of named concepts/classes a...

• Type: Conference
• Year: 2010
• Where: ECAI
• Authors: Mina Aslani, Volker Haarslev
• Keywords: Artificial Intelligence, Description Logic, ECAI 2010, Inference Services, OWL Ontologies