Using Lazy Unfolding for the Computation of Least Common Subsumers

For description logics with existential restrictions, the size of the least common subsumer (lcs) of concept descriptions may grow exponentially in the size of the concept descriptions. To reduce the size of the output descriptions and the run-time of the lcs algorithm we present an optimized algorithm for computing the lcs in ALE using lazy unfolding. A rst evaluation of the performance of the naive algorithm in comparison to the performance of the algorithm using lazy unfolding indicates a performance gain for both concept sizes as well as run-times. 1 Motivation In our application of chemical process engineering we support the construction of description logic (DL) knowledge bases in a bottom-up fashion: instead of directly de ning a new concept, the knowledge engineer introduces several typical examples as objects (individuals), which are then automatically generalized into a concept description by the system. This description is then o ered to the knowledge engineer as a possible...

• Type: Conference
• Year: 2001
• Where: DLOG
• Authors: Anni-Yasmin Turhan, Ralf Molitor
• Keywords: Automated Reasoning, Common Subsumer, Concept Description, Description, DLOG 2001