Scalable Temporal Reasoning
Abstract
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
Cite
Text
Staab and Hahn. "Scalable Temporal Reasoning." International Joint Conference on Artificial Intelligence, 1999.Markdown
[Staab and Hahn. "Scalable Temporal Reasoning." International Joint Conference on Artificial Intelligence, 1999.](https://mlanthology.org/ijcai/1999/staab1999ijcai-scalable/)BibTeX
@inproceedings{staab1999ijcai-scalable,
title = {{Scalable Temporal Reasoning}},
author = {Staab, Steffen and Hahn, Udo},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {1999},
pages = {1247-1252},
url = {https://mlanthology.org/ijcai/1999/staab1999ijcai-scalable/}
}