Branching allen

  • Authors:
  • Marco Ragni;Stefan Wölfl

  • Affiliations:
  • Institut für Informatik, Albert-Ludwigs-Universität Freiburg, Freiburg, Germany;Institut für Informatik, Albert-Ludwigs-Universität Freiburg, Freiburg, Germany

  • Venue:
  • SC'04 Proceedings of the 4th international conference on Spatial Cognition: reasoning, Action, Interaction
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

Allen's interval calculus is one of the most prominent formalisms in the domain of qualitative spatial and temporal reasoning. Applications of this calculus, however, are restricted to domains that deal with linear flows of time. But how the fundamental ideas of Allen's calculus can be extended to other, weaker structures than linear orders has gained only little attention in the literature. In this paper we will investigate intervals in branching flows of time, which are of special interest for temporal reasoning, since they allow for representing indeterministic aspects of systems, scenarios, planning tasks, etc. As well, branching time models, i.e., treelike non-linear structures, do have interesting applications in the field of spatial reasoning, for example, for modeling traffic networks. In a first step we discuss interval relations for branching time, thereby comprising various sources from the literature. Then, in a second step, we present some new complexity results concerning constraint satisfaction problems of interval relations in branching time.