Implementing Matching in ALE--First Results

Matching problems in Description Logics are theoretically well understood, with a variety of algorithms available for different DLs. Nevertheless, still no implementation of a general matching algorithm exists. The present paper presents an implementation of an existing matching algorithm for the DL ALE and shows first results on benchmarks w.r.t. randomly generated matching problems. The observed computation times show that the implementation performs well even on relatively large matching problems. 1 Motivation Matching in Description Logics (DLs) has been first introduced by Borgida and McGuinness in the context of the Classic system [9] as a means to filter out irrelevant aspects of large concept descriptions. It has also been mentioned that matching (as well as unification) can be used either to find redundancies in or to integrate knowledge bases [7, 10]. More recently, matching has been proposed to perform queries on knowledge bases, an application particularly interestin...

• Type: Conference
• Year: 2003
• Where: DLOG
• Authors: Sebastian Brandt
• Keywords: Algorithm, Automated Reasoning, DLOG 2003, Matching Algorithms, Matching Problems