计划和调度的混合时间推理

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

S. Badaloni, M. Berati

{"title":"计划和调度的混合时间推理","authors":"S. Badaloni, M. Berati","doi":"10.1109/TIME.1996.555674","DOIUrl":null,"url":null,"abstract":"This paper address the problem of representing heterogeneous temporal information in a uniform framework. Metric information relative to intervals is combined with qualitative information in a homogeneous representation based on a temporal constraint network. We illustrate the properties of the new sub-algebra called IDSA (Interval-Distance Sub-Algebra), the algorithms used to propagate temporal information and their complexity.","PeriodicalId":259291,"journal":{"name":"Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"Hybrid temporal reasoning for planning and scheduling\",\"authors\":\"S. Badaloni, M. Berati\",\"doi\":\"10.1109/TIME.1996.555674\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper address the problem of representing heterogeneous temporal information in a uniform framework. Metric information relative to intervals is combined with qualitative information in a homogeneous representation based on a temporal constraint network. We illustrate the properties of the new sub-algebra called IDSA (Interval-Distance Sub-Algebra), the algorithms used to propagate temporal information and their complexity.\",\"PeriodicalId\":259291,\"journal\":{\"name\":\"Proceedings Third International Workshop on Temporal Representation and Reasoning (TIME '96)\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1996-05-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"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.555674\",\"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.555674","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 13

摘要

本文解决了在统一框架中表示异构时间信息的问题。相对于区间的度量信息与基于时间约束网络的定性信息以同质表示相结合。我们说明了称为IDSA(区间距离子代数)的新子代数的性质，用于传播时间信息的算法及其复杂性。

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

查看原文本刊更多论文

Hybrid temporal reasoning for planning and scheduling

This paper address the problem of representing heterogeneous temporal information in a uniform framework. Metric information relative to intervals is combined with qualitative information in a homogeneous representation based on a temporal constraint network. We illustrate the properties of the new sub-algebra called IDSA (Interval-Distance Sub-Algebra), the algorithms used to propagate temporal information and their complexity.

求助全文

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

来源期刊

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

自引率

0.00%

发文量