Matching in Description Logics: Preliminary Results

Franz BaaderFranz Baader, A. BorgidaA. Borgida, D.L. McGuinnessD.L. McGuinness

Franz Baader, A. Borgida, D.L. McGuinness
Matching in Description Logics: Preliminary Results
In M.-L. Mugnier and M. Chein, eds., Proceedings of the Sixth International Conference on Conceptual Structures (ICCS-98), volume 1453 of Lecture Notes in Computer Science, 15-34, 1998. Springer

Details
Bibtex

KurzfassungAbstract
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 a description language allowing for conjunction, value restriction, and atomic negation, thus removing restrictions on the form of the patterns from previous work. The paper also addresses the question of matching problems with additional ``side conditions, which were motivated by practical experience.
Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory

The final publication is available at Springer.

@inproceedings{ Baader-Borgida-McGuinness-ICCS-98,
  address = {Montpelier (France)},
  author = {F. {Baader} and A. {Borgida} and D.L. {McGuinness}},
  booktitle = {Proceedings of the Sixth International Conference on Conceptual Structures (ICCS-98)},
  editor = {M.-L. {Mugnier} and M. {Chein}},
  pages = {15--34},
  publisher = {Springer--Verlag},
  series = {Lecture Notes in Computer Science},
  title = {Matching in Description Logics: {P}reliminary Results},
  volume = {1453},
  year = {1998},
}