Reasoning with sequences of point events

Abstract

Proposes the modeling of recurring events as multi-point events by extending Vilain and Kautz's (1986) point algebra. We then propose an exact algorithm, based on van Beek's (1990) exact algorithm, for finding feasible relations for multi-point event networks. The complexity of our method is compared with previously known results both for recurring and non-recurring events. We identify the special cases for which our multi-point based algorithm can find an exact solution. Finally, we summarise our paper with brief discussion on ongoing and future research.