We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.

Durham Research Online
You are in:

Complexity classification in qualitative temporal constraint reasoning.

Jonsson, P. and Krokhin, A. (2004) 'Complexity classification in qualitative temporal constraint reasoning.', Artificial Intelligence., 160 (1-2). pp. 35-51.


We study the computational complexity of the qualitative algebra which is a temporal constraint formalism that combines the point algebra, the point-interval algebra and Allen's interval algebra. We identify all tractable fragments and show that every other fragment is NP-complete.

Item Type:Article
Keywords:Temporal reasoning, Constraint satisfaction, Computational complexity.
Full text:(AM) Accepted Manuscript
Download PDF
Publisher Web site:
Date accepted:No date available
Date deposited:07 April 2010
Date of first online publication:December 2004
Date first made open access:No date available

Save or Share this output

Look up in GoogleScholar