Extending the Point Algebra into the Qualitative Algebra

Authors:
Andrei Krokhin;Peter Jonsson
Affiliations:
-;-
Venue:
TIME '02 Proceedings of the Ninth International Symposium on Temporal Representation and Reasoning (TIME'02)
Year:
2002

Citing 0
Cited 4

Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra

Journal of the ACM (JACM)
Complexity classification in qualitative temporal constraint reasoning

Artificial Intelligence
Complexity classification in qualitative temporal constraint reasoning

Artificial Intelligence
A method for characterizing tractable subsets of qualitative fuzzy temporal algebrae

WILF'05 Proceedings of the 6th international conference on Fuzzy Logic and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.