LATPub195: Unterschied zwischen den Versionen
Aus International Center for Computational Logic
Marcel Lippmann (Diskussion | Beiträge) KKeine Bearbeitungszusammenfassung |
Marcel Lippmann (Diskussion | Beiträge) KKeine Bearbeitungszusammenfassung |
||
| (2 dazwischenliegende Versionen desselben Benutzers werden nicht angezeigt) | |||
| Zeile 1: | Zeile 1: | ||
{{Publikation Erster Autor | {{Publikation Erster Autor | ||
|ErsterAutorVorname= | |ErsterAutorVorname=Franz | ||
|ErsterAutorNachname=Baader | |ErsterAutorNachname=Baader | ||
|FurtherAuthors=R. Küsters | |FurtherAuthors=R. Küsters | ||
| Zeile 10: | Zeile 10: | ||
|Month= | |Month= | ||
|Booktitle=Proceedings of the Seventh International Conference on Knowledge Representation and Reasoning (KR2000) | |Booktitle=Proceedings of the Seventh International Conference on Knowledge Representation and Reasoning (KR2000) | ||
|Editor=A.G. | |Editor=A.G. Cohn and F. Giunchiglia and B. Selman | ||
|Note= | |Note= | ||
|Organization= | |Organization= | ||
|Pages=261 | |Pages=261-272 | ||
|Publisher=Morgan Kaufmann Publishers | |Publisher=Morgan Kaufmann Publishers | ||
|Series= | |Series= | ||
| Zeile 20: | Zeile 20: | ||
}} | }} | ||
{{Publikation Details | {{Publikation Details | ||
|Abstract=Matching of concepts against patterns is a | |Abstract=Matching of concepts against patterns is a new inference task in Description Logics, which was originally motivated by applications of the CLASSIC system. Consequently, the work on this problem was until now mostly concerned with sublanguages of the CLASSIC language, which does not allow for existential restrictions. | ||
new inference task in Description Logics, which was | This paper extends the existing work on matching in two directions. On the one hand, the question of what are the most ``interesting" solutions of matching problems is explored in more detail. On the other hand, for languages with existential restrictions both, the complexity of deciding the solvability of matching problems and the complexity of actually computing sets of ``interesting" matchers are determined. The results show that existential restrictions make these computational tasks more complex. Whereas for sublanguages of CLASSIC both problems could be solved in polynomial time, this is no longer possible for languages with existential restrictions. | ||
originally motivated by applications of the CLASSIC | |||
system. Consequently, the work on this problem | |||
was until now mostly concerned with sublanguages of the | |||
CLASSIC language, which does not allow for | |||
existential restrictions. | |||
This paper extends the existing work on matching in two directions. | |||
hand, the question of what are the most ``interesting" solutions of matching | |||
problems is explored in more detail. | |||
existential restrictions both, the complexity of deciding the solvability of | |||
matching problems and the complexity of actually computing sets of | |||
``interesting" matchers are determined. | |||
restrictions make these computational tasks more complex. | |||
sublanguages of CLASSIC both problems could be solved in polynomial time, this | |||
is no longer possible for languages with existential restrictions. | |||
|ISBN= | |ISBN= | ||
|ISSN= | |ISSN= | ||
| Zeile 56: | Zeile 40: | ||
year = {2000}, | year = {2000}, | ||
} | } | ||
}} | }} | ||
Aktuelle Version vom 25. März 2015, 16:34 Uhr
Matching in Description Logics with Existential Restrictions
Franz BaaderFranz Baader, R. KüstersR. Küsters
Franz Baader, R. Küsters
Matching in Description Logics with Existential Restrictions
In A.G. Cohn and F. Giunchiglia and B. Selman, eds., Proceedings of the Seventh International Conference on Knowledge Representation and Reasoning (KR2000), 261-272, 2000. Morgan Kaufmann Publishers
Matching in Description Logics with Existential Restrictions
In A.G. Cohn and F. Giunchiglia and B. Selman, eds., Proceedings of the Seventh International Conference on Knowledge Representation and Reasoning (KR2000), 261-272, 2000. Morgan Kaufmann Publishers
- KurzfassungAbstract
Matching of concepts against patterns is a new inference task in Description Logics, which was originally motivated by applications of the CLASSIC system. Consequently, the work on this problem was until now mostly concerned with sublanguages of the CLASSIC language, which does not allow for existential restrictions. This paper extends the existing work on matching in two directions. On the one hand, the question of what are the most ``interesting" solutions of matching problems is explored in more detail. On the other hand, for languages with existential restrictions both, the complexity of deciding the solvability of matching problems and the complexity of actually computing sets of ``interesting" matchers are determined. The results show that existential restrictions make these computational tasks more complex. Whereas for sublanguages of CLASSIC both problems could be solved in polynomial time, this is no longer possible for languages with existential restrictions. - Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory
@inproceedings{ BaaderKuesters-KR-2000,
address = {San Francisco, CA},
author = {F. {Baader} and R. {K{\"u}sters}},
booktitle = {Proceedings of the Seventh International Conference on Knowledge Representation and Reasoning (KR2000)},
editor = {A.G. {Cohn} and F. {Giunchiglia} and B. {Selman}},
pages = {261--272},
publisher = {Morgan Kaufmann Publishers},
title = {Matching in Description Logics with Existential Restrictions},
year = {2000},
}
