用点事件序列推理

Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96) Pub Date : 1996-05-19 DOI:10.1109/TIME.1996.555672

Rattana Wetprasit, A. Sattar, L. Khatib

{"title":"用点事件序列推理","authors":"Rattana Wetprasit, A. Sattar, L. Khatib","doi":"10.1109/TIME.1996.555672","DOIUrl":null,"url":null,"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.","PeriodicalId":259291,"journal":{"name":"Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96)","volume":"217 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Reasoning with sequences of point events\",\"authors\":\"Rattana Wetprasit, A. Sattar, L. Khatib\",\"doi\":\"10.1109/TIME.1996.555672\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":259291,\"journal\":{\"name\":\"Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96)\",\"volume\":\"217 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1996-05-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TIME.1996.555672\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TIME.1996.555672","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 5

摘要

通过扩展Vilain和Kautz(1986)的点代数，提出将重复事件建模为多点事件。然后，我们在van Beek(1990)精确算法的基础上提出了一种精确算法，用于寻找多点事件网络的可行关系。我们的方法的复杂性与以前已知的重复和非重复事件的结果进行了比较。我们确定了我们的多点算法可以找到精确解的特殊情况。最后，我们总结了我们的论文，并简要讨论了正在进行和未来的研究。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96)

自引率

0.00%

发文量