Matching in description logics: preliminary results

From Semantic Portal Wiki

Jump to: navigation, search

{{#vardefine:category|Publication}}{{#vardefine:templatename|i.publication}}{{#vardefine:package|smwbp_instance_templates}}

Edit

Reference: {{#vardefine:pagename|matching in description logics: preliminary results }}

  1. [[]]

bibtex

{{#vardefine:pagename|Matching in description logics: preliminary results }}{{#vardefine:key| }}

abstract: 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.

download:

Facts about Matching in description logics: preliminary resultsRDF feed
AbstractMatching 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.
AddressTrento, Italy  +
AuthorFranz Baader  +, Alexander Borgida  +, and Deborah L. McGuinness  +
Bibtypeinproceedings  +
BooktitleProceedings of the 1998 International Workshop on Description Logics  +
Doihttp://SunSITE.Informatik.RWTH-Aachen.DE/Publications/CEUR-WS/Vol-11/BaBoMc.ps  +
Keydblp:conf/dlog/baaderbm98  +
MonthJune  +
NoteAn 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 urlhttp://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS/Vol-11/BaBoMc.ps  +
Sourcehttp://dblp.uni-trier.de/rec/bibtex/conf/dlog/BaaderBM98  +
TagComputer science  +
TitleMatching in Description Logics: Preliminary Results  +
Year1998  +
Personal tools
Semantic Web Community
Tetherless World constellation
maintenance