Reasoning with Sequences of Point Events* (An Extended 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.
[1] James F. Allen. Maintaining knowledge about temporal intervals , 1983, CACM.
[2] Henry A. Kautz,et al. Constraint Propagation Algorithms for Temporal Reasoning , 1986, AAAI.
[3] Peter B. Ladkin,et al. On binary constraint problems , 1994, JACM.
[4] Eugene C. Freuder. A Sufficient Condition for Backtrack-Free Search , 1982, JACM.