Proceedings of the 3rd Annual Rocky Mountain Conference on Artificial Intelligence

Endpoint Relations on Temporal Intervals

, , , and

Allen's interval algebra has become one of the major schemes used in AI for temporal reasoning. However, Allen's algebra has the esthetically displeasing property that the less one knows about the relationship between two intervals, the longer must be the symbolic expression of that knowledge. This paper presents a reformulation of Allen's interval algebra in terms of more primitive relations between intervals, such that less knowledge requires a shorter symbolic expression. In addition, the reformulation results in a significant simplification of Allen's transitivity table.

  • 1377480 bytes


Downloads: 53 downloads

UMBC ebiquity