Optimizing TBox and ABox Reasoning with Pseudo Models.
Volker Haarslev, Ralf Möller · 2000
This paper investigates optimization techniques and data structures exploiting the use of so-called pseudo models . These techniques are applied to speed-up TBox and ABox reasoning for the description logic ALCNH R + . The advances are demonstrated by an empirical analysis using the description logic system RACE that implements TBox and ABox reasoning for ALCNH R + . 1 Introduction We introduce and analyze optimization techniques for reasoning in expressive description logics exploiting so-called pseudo models. The new techniques being investigated are called deep model merging and individual model merging. The presented algorithms are empirically evaluated using TBoxes and ABoxes derived from actual applications. We briefly introduce the DL ALCNHR + [2]. We assume a set of concept names C , a set of role names R, and a set of individual names O . The mutually disjoint subsets F , P , T of R denote features, non-transitive, and transitive roles, respectively (R = F # P #...