Reasoning with sequences of point events
暂无分享,去创建一个
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.
[1] Henry A. Kautz,et al. Constraint Propagation Algorithms for Temporal Reasoning , 1986, AAAI.
[2] Peter B. Ladkin,et al. On binary constraint problems , 1994, JACM.
[3] Eugene C. Freuder. A Sufficient Condition for Backtrack-Free Search , 1982, JACM.
[4] James F. Allen. Maintaining knowledge about temporal intervals , 1983, CACM.
[5] Alan K. Mackworth. Consistency in Networks of Relations , 1977, Artif. Intell..