Article473: Unterschied zwischen den Versionen
K (Added from ontology) |
Ne2260 (Diskussion | Beiträge) K (Textersetzung - „Forschungsgruppe=Wissensmanagement“ durch „Forschungsgruppe=Web Science und Wissensmanagement“) |
||
| (5 dazwischenliegende Versionen von einem anderen Benutzer werden nicht angezeigt) | |||
| Zeile 1: | Zeile 1: | ||
| − | {{Publikation | + | {{Publikation Erster Autor |
| − | | | + | |ErsterAutorNachname=Staab |
| − | | | + | |ErsterAutorVorname=Steffen |
}} | }} | ||
{{Article | {{Article | ||
| Zeile 12: | Zeile 12: | ||
|Abstract=In this paper a new approach towards temporal reasoning is presented that scales up from the temporal relations commonly used in Allen's qualitative interval calculus and in quantitative temporal constraint satisfaction problems to include interval relations with distances, temporal rules and other non-binary relations into the reasoning scheme. For this purpose, we generalize well-known methods for constraint propagation, determination of consistency and computation of the minimal network from simpler schemes that only allow for binary relations. Thereby, we and that levels of granularity play a major role for applying these techniques in our more expressive framework. Indeed, the technical preliminaries we provide are especially apt to investigate the switching between different granularities of representation, hence illucitating and exploiting the tradeoff between expressiveness and efficiency of temporal reasoning schemes on the one side and between expressiveness and understandability on the other side. | |Abstract=In this paper a new approach towards temporal reasoning is presented that scales up from the temporal relations commonly used in Allen's qualitative interval calculus and in quantitative temporal constraint satisfaction problems to include interval relations with distances, temporal rules and other non-binary relations into the reasoning scheme. For this purpose, we generalize well-known methods for constraint propagation, determination of consistency and computation of the minimal network from simpler schemes that only allow for binary relations. Thereby, we and that levels of granularity play a major role for applying these techniques in our more expressive framework. Indeed, the technical preliminaries we provide are especially apt to investigate the switching between different granularities of representation, hence illucitating and exploiting the tradeoff between expressiveness and efficiency of temporal reasoning schemes on the one side and between expressiveness and understandability on the other side. | ||
|VG Wort-Seiten= | |VG Wort-Seiten= | ||
| − | | | + | |Download=2001_473_Staab_From_Binary_Tem_1.pdf, 2001_473_Staab_From_Binary_Tem_1.ps |
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
|Projekt= | |Projekt= | ||
| − | |Forschungsgruppe= | + | |Forschungsgruppe=Web Science und Wissensmanagement |
}} | }} | ||
Aktuelle Version vom 11. November 2015, 07:57 Uhr
From Binary Temporal Relations to Non-Binary Ones and Back
From Binary Temporal Relations to Non-Binary Ones and Back
Veröffentlicht: 2001
Journal: Artificial Intelligence, Elsevier
Referierte Veröffentlichung
Kurzfassung
In this paper a new approach towards temporal reasoning is presented that scales up from the temporal relations commonly used in Allen's qualitative interval calculus and in quantitative temporal constraint satisfaction problems to include interval relations with distances, temporal rules and other non-binary relations into the reasoning scheme. For this purpose, we generalize well-known methods for constraint propagation, determination of consistency and computation of the minimal network from simpler schemes that only allow for binary relations. Thereby, we and that levels of granularity play a major role for applying these techniques in our more expressive framework. Indeed, the technical preliminaries we provide are especially apt to investigate the switching between different granularities of representation, hence illucitating and exploiting the tradeoff between expressiveness and efficiency of temporal reasoning schemes on the one side and between expressiveness and understandability on the other side.
Download: Media:2001_473_Staab_From_Binary_Tem_1.pdf,Media:2001_473_Staab_From_Binary_Tem_1.ps
Web Science und Wissensmanagement