Programming Research Group Research Report RR-01-12

Reasoning about temporal relations : the tractable subalgebras of Allen's interval algebra

Andrei Krokhin, Peter Jeavons and Peter Jonsson

July 2001, 54pp.

Abstract

Allen's interval algebra is one of the best established formalisms for temporal reasoning. This paper is the final step in the classification of complexity in Allen's algebra. We show that the current knowledge about tractability in the interval algebra is complete, that is, this algebra contains exactly eighteen maximal tractable subalgebras, and reasoning in any fragment not entirely contained in one of these subalgebras is NP-complete. We obtain this result by giving a new uniform description of the known maximal tractable subalgebras and then systematically using an algebraic technique for identifying maximal subalgebras with a given property.


This paper is available as a 240403 bytes gzipped PostScript file.