We study the computational complexity of the qualitative algebra which is a temporal formalism that combines the point algebra, the point-interval algebra and Allen’s interval algebra. We identify all tractable fragments containing the point algebra and show that, for all other fragments containing the point algebra, the problem is NP-complete.
