LATPub73: 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 20: | Zeile 20: | ||
}} | }} | ||
{{Publikation Details | {{Publikation Details | ||
|Abstract=We investigate how terminological knowledge representation systems can be used | |Abstract=We investigate how terminological knowledge representation systems can be used to support modeling in an engeneering application. Because of the high complexity of the application, support of top--down modeling is a quite ambitious, but useful task for TKR Systems. An interesting problem to solve in this context is the handling of composite objects. Therefor, not only different part-whole relations have to be represented (some of them are transitive) but also their transitivity-like interaction as well as local properties of these relations. Hence this application calls for a concept language with powerful role forming operators. | ||
to support modeling in an engeneering application. Because of the high | A concept language P with the expressive power to represent part-whole relations is defined, but it turns out that satisfiability of concept terms in P is undecidable. Hence it is necessary to drop some (but not many) of the demands made for the benefit of decidability. Several ways to handle the high complexity of inference algorithms of P are discussed. | ||
complexity of the application, support of top--down modeling is a quite | |||
ambitious, but useful task for TKR Systems. An interesting problem to solve in | |||
this context is the handling of composite objects. Therefor, not only different | |||
part-whole relations have to be represented (some of them are transitive) but | |||
also their transitivity-like interaction as well as local properties of these | |||
relations. Hence this application calls for a concept language with powerful | |||
role forming operators. | |||
A concept language P with the expressive power to represent part-whole | |||
relations is defined, but it turns out that satisfiability of concept terms in | |||
P is undecidable. Hence it is necessary to drop some (but not many) of | |||
the demands made for the benefit of decidability. Several ways to handle the | |||
high complexity of inference algorithms of P are discussed. | |||
|ISBN= | |ISBN= | ||
|ISSN= | |ISSN= | ||
| Zeile 53: | Zeile 39: | ||
year = {1995}, | year = {1995}, | ||
} | } | ||
}} | }} | ||
Version vom 23. März 2015, 13:23 Uhr
A Concept Language for an engeneering application with part-whole relations
Ulrike SattlerUlrike Sattler
Ulrike Sattler
A Concept Language for an engeneering application with part-whole relations
In A. Borgida and M. Lenzerini and D. Nardi and B. Nebel, eds., Proceedings of the International Workshop on Description Logics, 119-123, 1995
A Concept Language for an engeneering application with part-whole relations
In A. Borgida and M. Lenzerini and D. Nardi and B. Nebel, eds., Proceedings of the International Workshop on Description Logics, 119-123, 1995
- KurzfassungAbstract
We investigate how terminological knowledge representation systems can be used to support modeling in an engeneering application. Because of the high complexity of the application, support of top--down modeling is a quite ambitious, but useful task for TKR Systems. An interesting problem to solve in this context is the handling of composite objects. Therefor, not only different part-whole relations have to be represented (some of them are transitive) but also their transitivity-like interaction as well as local properties of these relations. Hence this application calls for a concept language with powerful role forming operators. A concept language P with the expressive power to represent part-whole relations is defined, but it turns out that satisfiability of concept terms in P is undecidable. Hence it is necessary to drop some (but not many) of the demands made for the benefit of decidability. Several ways to handle the high complexity of inference algorithms of P are discussed. - Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory
@inproceedings{ Sa95,
address = {Rome},
author = {Ulrike {Sattler}},
booktitle = {Proceedings of the International Workshop on Description Logics},
editor = {A. {Borgida} and M. {Lenzerini} and D. {Nardi} and B. {Nebel}},
pages = {119--123},
title = {A Concept Language for an engeneering application with part-whole relations},
year = {1995},
}
