Reasoning with Sequences of Point Events
Abstract
We propose to model recurring events as multipoint events by extending Vilain and Kautz's point algebra [7]. We then propose an exact algorithm based on van Beek's exact algorithm) forfinding feasi 6 le 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 exact solution. Finally, we summarise our paper with brief discussion on ongoing and future research.
Conference Title
Proceedings of the International Workshop on Temporal Representation and Reasoning
Publisher URI
Copyright Statement
© 1996 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Subject
Biosecurity science and invasive species ecology