Temporal Constraint Satisfaction Problems

Abstract

In this paper we deal with the problem of temporal reasoning as a special case of a constraint satisfaction problem. We review several models, either qualitative or metric, for constraint based temporal reasoning and we show the main features of each one, such as expressivity and computational complexity. We also show some recent advances in the field of temporal reasoning with points and durations as temporal objects and finally we suggest some future works.