Towards a complete classification of tractability in Allen's algebra

  • Authors:

  • Thomas Drakengren;Peter Jonsson

  • Affiliations:

  • Department of Computer and Information Science, Linkoping University, Linkoping, Sweden;Department of Computer and Information Science, Linkoping University, Linkoping, Sweden

  • Venue:
  • IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
  • Year:
  • 1997

Quantified Score

Hi-index 0.00

Visualization

Abstract

We characterise the set of subalgebras of Allen's algebra which have a tractable satisfiability problem, and in addition contain certain basic relations. The conclusion is that no tractable subalgebra that is not known in the literature can contain more than the three basic relations (≡), (b) and (b-), where b ∈ {d,o,s,f}. This means that concerning algebras for specifying complete knowledge about temporal information, there is no hope of finding yet unknown classes with much expressivity. Furthermore, we show that there are exactly two maximal tractable algebras which contain the relation (). Both of these algebras can express the notion of sequentially; thus we have a complete characterisation of tractable inference using that notion.