| 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 discard 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
|
Trento, Italy +
|
| Author
|
Franz Baader +,
Alexander Borgida +,
Deborah L. McGuinness +
|
| Bibtype
|
inproceedings +
|
| Booktitle
|
Proceedings of the 1998 International Workshop on Description Logics +
|
| Doi
|
http://SunSITE.Informatik.RWTH-Aachen.DE/Publications/CEUR-WS/Vol-11/BaBoMc.ps +
|
| Key
|
dblp:conf/dlog/baaderbm98 +
|
| Modification dateThis property is a special property in this wiki.
|
24 April 2009 18:01:03 +
|
| Month
|
June +
|
| Note
|
An updated version appears in Proceedings of the Sixth International Conference on Conceptual Structures (ICCS'98), M.-L. Mugnier, M. Chein (editors), Lecture Notes in Artificial Intelligence, Springer, 1998. +
|
| Paper url
|
http://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS/Vol-11/BaBoMc.ps +
|
| Source
|
http://dblp.uni-trier.de/rec/bibtex/conf/dlog/BaaderBM98 +
|
| Tag
|
Computer science +
|
| Title
|
Matching in Description Logics: Preliminary Results +
|
| Year
|
1998 +
|
| Categories |
Workshop Paper,
Proceeding Paper,
Publication
|
