One of the most frequently used inference services of description logic reasoners is the classification of TBoxes with a subsumption hierarchy of all named concepts as the result. In response to (i) emerging TBoxes from the semantic web community consisting of up to hundreds of thousand of named concepts and (ii) the increasing availability of multi-processor and multi-or many-core computers, we propose a parallel approach for TBox classification. First experiments on parallelizing well-known

more »

... gorithms for TBox classification were conducted to study the trade-off between incompleteness and speed improvement.