Scalable Temporal Reasoning
Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence. Temporal Reasoning. Pages 1247-1251.
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.
@inproceedings{ijcai1999p177,
title = {Scalable Temporal Reasoning},
author = {Staab, Steffen and Hahn, Udo},
booktitle = {Proceedings of the Sixteenth International Joint Conference on
Artificial Intelligence, {IJCAI-99}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Thomas Dean},
pages = {1247--1251},
year = {1999},
note = {Temporal Reasoning},
url = {https://ijcai.org/proceedings/1999/177},
}
TY - CPAPER TI - Scalable Temporal Reasoning AU - Staab, Steffen AU - Hahn, Udo T2 - Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, IJCAI-99 PB - International Joint Conferences on Artificial Intelligence PY - 1999 SP - 1247 EP - 1251 UR - https://ijcai.org/proceedings/1999/177 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
