| Abstract
|
Matching of concepts with variables (conce … Matching of concepts with variables (concept patterns) is a relatively new operation that has been introduced in the context of concept description languages (description logics), originally to help filter out unimportant aspects of large concepts appearing in industrial-strength knowledge bases. This paper proposes a new approach to performing matching, based on a “concept-centered” 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 FL¬, thus removing restrictions from previous work. The paper also addresses the question of matching problems with additional “side conditions”, which were motivated by practical experience. ch were motivated by practical experience.
|
| Address
|
Montpellier, France +
|
| Author
|
Franz Baader +,
Alex Borgida +,
Deborah L. McGuinness +
|
| Bibtype
|
inproceedings +
|
| Booktitle
|
Proceedings of the 6th International Conference on Conceptual Structures, ICCS’98 +
|
| Key
|
baader1998matching +
|
| Modification dateThis property is a special property in this wiki.
|
24 April 2009 17:53:04 +
|
| Month
|
August +
|
| Note
|
An earlier version appears in in Proceedings of the 1998 International Workshop on Description Logics, Trento, Italy. June, 1998 +
|
| Pages
|
15-34 +
|
| Paper url
|
http://dx.doi.org/10.1007/BFb0054902 +
|
| Tag
|
Computer science +
|
| Title
|
Matching in description logics: Preliminary results +
|
| Year
|
1998 +
|
| Categories |
Conference Paper,
Proceeding Paper,
Publication
|
