Home  Online Resources  Table of Contents

Journal of Logic and Computation, Volume 9, Issue 3, pp. 411-447: Abstract.

Matching in description logics

F Baader1, R Küsters1, A Borgida2 and DL McGuinness3

1Theoretical Computer Science, RWTH Aachen, 52074 Aachen, Germany. E-mail: {baader, kuesters}@informatik.rwth-aachen.de, 2Department of Computer Science, Rutgers University, New Brunswick, NJ, USA. E-mail: borgida@cs.rutgers.edu, 3Department of Computer Science, Stanford University, Gates Building, Stanford University, CA 94305, USA. E-mail: dlm@ksl.stanford.edu

Matching concepts against patterns (concepts with variables) is a relatively new operation that has been introduced in the context of concept description languages (description logics). The original goal was to help filter out unimportant aspects of complicated concepts appearing in large industrial knowledge bases. We propose a new approach to performing matching, based on a 'concept-centred' normal form, rather than the more standard 'structural subsumption' normal form for concepts. As a result, matching can be performed (in polynomial time) using arbitrary concept patterns of the description language ALN, thus removing restrictions from previous work. The paper also addresses the question of matching problems with additional 'side conditions', which were motivated by practical needs.

Key words: Knowledge representation, description logics, matching.

  Full-Text PDF  (379 KB)

[ Oxford University Press]   [ Oxford Journals]   [ Comments & Feedback]   Copyright© Oxford University Press, 1999.