Computational complexity of relating time points with intervals
From MaRDI portal
Publication:1292318
DOI10.1016/S0004-3702(99)00007-7zbMath0916.68073OpenAlexW2056005219MaRDI QIDQ1292318
Christer Bäckström, Peter Jonsson, Thomas Drakengren
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
Related Items (6)
From binary temporal relations to non-binary ones and back ⋮ 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 ⋮ The complexity of constraint satisfaction problems for small relation algebras ⋮ Complexity classification in qualitative temporal constraint reasoning
This page was built for publication: Computational complexity of relating time points with intervals
