论文信息 - Implementing Matching in ALE--First Results

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.

Sebastian Brandt

[1] Paliath Narendran,et al. Unification of Concept Terms in Description Logics , 2001, Description Logics.

[2] Volker Haarslev,et al. RACER System Description , 2001, IJCAR.

[3] Ralf Küsters,et al. Matching in Description Logics with Existential Restrictions , 1999, Description Logics.

[4] Deborah L. McGuinness,et al. CLASSIC: a structural data model for objects , 1989, SIGMOD '89.

[5] Deborah L. McGuinness,et al. Matching in Description Logics , 1999, J. Log. Comput..

[6] Ralf Küsters,et al. Matching under Side Conditions in Description Logics , 2001, IJCAI.

[7] Ian Horrocks. The FaCT System , 1998, TABLEAUX.

[8] Alexander Borgida,et al. What's not in a name: Some Properties of a Purely Structural Approach to Integrating Large DL Knowledge Bases , 2000, Description Logics.

[9] Anni-Yasmin Turhan,et al. Using Non-standard Inferen es in Des ription Logi s | what does it buy me ? , 2001 .

[10] Ralf Küsters,et al. Computing Least Common Subsumers in Description Logics with Existential Restrictions , 1999, IJCAI.

[11] Franz Baader,et al. On the Problem of Computing Small Representations of Least Common Subsumers , 2002, KI.