Cookies

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.

Abstract

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:PDF - Accepted Version (287Kb)
Status:Peer-reviewed
Publisher Web site:http://dx.doi.org/10.1016/j.artint.2004.05.010
Record Created:29 Mar 2010 11:05
Last Modified:14 Dec 2011 09:51

Social bookmarking: del.icio.usConnoteaBibSonomyCiteULikeFacebookTwitterExport: EndNote, Zotero | BibTex
Usage statisticsLook up in GoogleScholar | Find in a UK Library