Allen's interval algebra

For the type of boolean algebra called interval algebra, see Boolean algebra (structure)

Allen's interval algebra is a calculus for temporal reasoning that was introduced by James F. Allen in 1983.

The calculus defines possible relations between time intervals and provides a composition table that can be used as a basis for reasoning about temporal descriptions of events.

Formal description

Relations

The following 13 base relations capture the possible relations between two intervals.

Relation	Illustration	Interpretation
$X \,\mathrel{\mathbf{<}}\, Y$ $Y \,\mathrel{\mathbf{>}}\, X$		X takes place before Y
$X \,\mathrel{\mathbf{m}}\, Y$ $Y \,\mathrel{\mathbf{mi}}\, X$		X meets Y (i stands for inverse)
$X \,\mathrel{\mathbf{o}}\, Y$ $Y \,\mathrel{\mathbf{oi}}\, X$		X overlaps with Y
$X \,\mathrel{\mathbf{s}}\, Y$ $Y \,\mathrel{\mathbf{si}}\, X$		X starts Y
$X \,\mathrel{\mathbf{d}}\, Y$ $Y \,\mathrel{\mathbf{di}}\, X$		X during Y
$X \,\mathrel{\mathbf{f}}\, Y$ $Y \,\mathrel{\mathbf{fi}}\, X$		X finishes Y
$X \,\mathrel{\mathbf{=}}\, Y$		X is equal to Y

Using this calculus, given facts can be formalized and then used for automatic reasoning. Relations between intervals are formalized as sets of base relations.

The sentence

During dinner, Peter reads the newspaper. Afterwards, he goes to bed.

is formalized in Allen's Interval Algebra as follows:

$\mbox{newspaper } \mathbf{\{ \operatorname{d}, \operatorname{s}, \operatorname{f} \}} \mbox{ dinner}$

$\mbox{dinner } \mathbf{\{ \operatorname{<}, \operatorname{m} \}} \mbox{ bed}$

In general, the number of different relations between n intervals is 1, 1, 13, 409, 23917, 2244361... OEIS A055203. The special case shown above is for n=2.

Composition of relations between intervals

For reasoning about the relations between temporal intervals, Allen's Interval Algebra provides a composition table. Given the relation between $X$ and $Y$ and the relation between $Y$ and $Z$, the composition table allows for concluding about the relation between $X$ and $Z$. Together with a converse operation, this turns Allen's Interval Algebra into a relation algebra.

For the example, one can infer $\mbox{newspaper } \mathbf{\{ \operatorname{<}, \operatorname{m} \}} \mbox{ bed}$.

Extensions

Allen's Interval Algebra can be used for the description of both temporal intervals and spatial configurations. For the latter use, the relations are interpreted as describing the relative position of spatial objects. This also works for three-dimensional objects by listing the relation for each coordinate separately.

Implementation

• A simple java library implementing the concept of Allen's temporal relations and the path consistency algorithm

See also

• Temporal logic
• Logic
• Region Connection Calculus.
• Spatial relation (analog)
• Commonsense reasoning

References

• James F. Allen: Maintaining knowledge about temporal intervals. In: Communications of the ACM. 26 November 1983. ACM Press. pp. 832–843, ISSN 0001-0782
• Bernhard Nebel, Hans-Jürgen Bürckert: Reasoning about Temporal Relations: A Maximal Tractable Subclass of Allen's Interval Algebra. In: Journal of the ACM 42, pp. 43–66. 1995.
• Peter van Beek, Dennis W. Manchak: The design and experimental analysis of algorithms for temporal reasoning. In: Journal of Artificial Intelligence Research 4, pp. 1–18, 1996.