LATPub172: Unterschied zwischen den Versionen
Aus International Center for Computational Logic
Marcel Lippmann (Diskussion | Beiträge) KKeine Bearbeitungszusammenfassung |
Marcel Lippmann (Diskussion | Beiträge) KKeine Bearbeitungszusammenfassung |
||
| Zeile 1: | Zeile 1: | ||
{{Publikation Erster Autor | {{Publikation Erster Autor | ||
|ErsterAutorVorname= | |ErsterAutorVorname=Franz | ||
|ErsterAutorNachname=Baader | |ErsterAutorNachname=Baader | ||
|FurtherAuthors=R. Küsters; A. Borgida; D. McGuinness | |FurtherAuthors=R. Küsters; A. Borgida; D. McGuinness | ||
| Zeile 18: | Zeile 18: | ||
}} | }} | ||
{{Publikation Details | {{Publikation Details | ||
|Abstract=Matching concepts against patterns (concepts with variables) | |Abstract=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 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 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. | ||
is a relatively new operation that has been introduced in the | |||
context of concept description languages (description logics). | |||
The original goal was to | |||
complicated concepts appearing in large industrial knowledge bases. | |||
We propose 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 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. | |||
|ISBN= | |ISBN= | ||
|ISSN= | |ISSN= | ||
| Zeile 49: | Zeile 36: | ||
year = {1999}, | year = {1999}, | ||
} | } | ||
}} | }} | ||
Version vom 23. März 2015, 13:24 Uhr
Matching in Description Logics
Franz BaaderFranz Baader, R. KüstersR. Küsters, A. BorgidaA. Borgida, D. McGuinnessD. McGuinness
Franz Baader, R. Küsters, A. Borgida, D. McGuinness
Matching in Description Logics
Journal of Logic and Computation, 9(3):411-447, 1999
Matching in Description Logics
Journal of Logic and Computation, 9(3):411-447, 1999
- KurzfassungAbstract
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 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 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. - Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory
@article{ BaadKuestBorgMcGuinn-JLC-99,
author = {F. {Baader} and R. {K{\"u}sters} and A. {Borgida} and D. {McGuinness}},
journal = {Journal of Logic and Computation},
number = {3},
pages = {411--447},
title = {Matching in Description Logics},
volume = {9},
year = {1999},
}
