Implementing Matching in ALE--First Results.
Sebastian Brandt · 2003
Matching problems in Description Logics are theoretically well understood, with a variety of algorithms available for di#erent 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 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.