Scalable temporal reasoning

  • Authors:
  • Steffen Staab;Udo Hahn

  • Affiliations:
  • Institute for Applied Computer Science and Formal Description Methods, Karlsruhe University, Karlsruhe, Germany;Text Understanding Lab, Computational Linguistics Division, Freiburg University, Freiburg, Germany

  • Venue:
  • IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

We introduce two mechanisms for scaling computations in the framework of temporal reasoning. The first one addresses abstraction at the methodological 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 generalizations of temporal relations are introduced that approximate more fine-grained representations by abstracting away irrelevant details.