Scalable temporal reasoning
Steffen Staab, Udo Hahn · 1999
We introduce two mechanisms for scaling com-putations in the framework of temporal reasoning. The first one addresses abstraction at the method-ological level. Operators are defined that engender flexible switching between different granularities of temporal representation structures. The second one accounts for abstractions at the interface level of a temporal reasoning engine. Various general-izations of temporal relations are introduced that approximate more fine-grained representations by abstracting away irrelevant details. 1