liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
Extending the Point Algebra into the Qualitative Algebra
Oxford University Computing Laboratory.
Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory. Linköping University, The Institute of Technology.
2002 (English)In: Proc. of the 9th Int'l Symposium on Temporal Representation and Reasoning (TIME-2002)', IEEE , 2002, 28-35 p.Conference paper (Refereed)
Abstract [en]

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.

Place, publisher, year, edition, pages
IEEE , 2002. 28-35 p.
National Category
Engineering and Technology
URN: urn:nbn:se:liu:diva-61724DOI: 10.1109/TIME.2002.1027469ISBN: 0-7695-1474-XOAI: diva2:370714
Available from: 2010-11-17 Created: 2010-11-17 Last updated: 2010-11-26

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Jonsson, Peter
By organisation
TCSLAB - Theoretical Computer Science LaboratoryThe Institute of Technology
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 17 hits
ReferencesLink to record
Permanent link

Direct link