Computational complexity of relating time points with intervals

DOI10.1016/S0004-3702(99)00007-7MaRDI QIDQ1292318zbMATH OpenOpenAlexFDO

Authors Peter Jonsson, Thomas Drakengren, Christer Bäckström

Publication date 21 June 1999

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0004-3702(99)00007-7

zbMATH Keywords

algorithmscomplexityconstraint satisfactiontemporal reasoningpoint-interval algebra

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Point algebras for temporal reasoning: Algorithms and complexity
• Complexity classification in qualitative temporal constraint reasoning
• Reasoning about temporal relations, the tractable subalgebras of Allen's interval algebra
• Reasoning about temporal relations
• scientific article; zbMATH DE number 1882046

Cited in

(9)

• From binary temporal relations to non-binary ones and back
• Branching interval algebra: an almost complete picture
• Complexity classification in qualitative temporal constraint reasoning
• The complexity of constraint satisfaction problems for small relation algebras
• scientific article; zbMATH DE number 2086406 (Why is no real title available?)
• Computational complexity and feasibility of data processing and interval computations
• A new approach to cyclic ordering of 2D orientations using ternary relation algebras
• Satisfying constraint sets through convex envelopes
• Point algebras for temporal reasoning: Algorithms and complexity

This page was built for publication: Computational complexity of relating time points with intervals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292318)