| Abstract
|
Matching concepts against patterns (concep … 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 anew 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. , which were motivated by practical needs.
|
| Author
|
Franz Baader +,
Ralf Küsters +,
Alex Borgida +,
Deborah L. McGuinness +
|
| Bibtype
|
article +
|
| Journal
|
Journal of Logic and Computation -- Special Issue on Description Logics +
|
| Key
|
KSL-99-13 +
|
| Modification dateThis property is a special property in this wiki.
|
1 May 2009 17:47:49 +
|
| Month
|
June +
|
| Number
|
3 +
|
| Pages
|
411-447 +
|
| Paper url
|
http://dx.doi.org/10.1093/logcom/9.3.411 +
|
| Tag
|
Description logic +,
Computer science +
|
| Title
|
Matching in Description Logics +
|
| Tr id
|
KSL-99-13 +
|
| Volume
|
9 +
|
| Year
|
1999 +
|
| Categories |
Journal Paper,
Publication,
KSL Technical Report
|
