High Performance Reasoning with Very Large Knowledge Bases.
Volker Haarslev, Ralf Möller · 2000
In this contribution we present an empirical analysis of the performance of the ALCNH R + description logic system RACE applied to TBoxes with a very large number of primitive concept definitions. Adaptions of previously known techniques as well as new optimization techniques for e#ciently dealing with these kinds of knowledge bases are discussed. 1 Motivation In application projects it is often necessary to deal with TBoxes with a large number of axioms. In addition, in many applications only a small subset of the axioms are true generalized concept inclusions (GCIs). In most cases, axioms are concept introduction axioms. Usually it has been argued that only systems based on incomplete calculi can deal with knowledge bases with more than 100,000 axioms of this kind. In this contribution we present an empirical analysis of the performance of the ALCNH R + description logic system RACE [4, 6] applied to knowledge bases of this size. 1 It is shown that description logic sys...