最终，空间和时间推理的周期性定性约束网络

17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05) Pub Date : 2005-11-14 DOI:10.1109/ICTAI.2005.124

Jean-François Condotta, G. Ligozat, S. Tripakis

{"title":"最终，空间和时间推理的周期性定性约束网络","authors":"Jean-François Condotta, G. Ligozat, S. Tripakis","doi":"10.1109/ICTAI.2005.124","DOIUrl":null,"url":null,"abstract":"We consider qualitative temporal or spatial constraint networks whose constraints evolve over time in an ultimately periodic fashion: after an initial stretch of time, a fixed pattern of constraints (over an interval) is reproduced indefinitely. We propose a local propagation algorithm which is polynomial, and we show that it decides the consistency problem in some particular cases. We also show that the general problem of consistency for such networks is in PSPACE","PeriodicalId":294694,"journal":{"name":"17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Ultimately periodic qualitative constraint networks for spatial and temporal reasoning\",\"authors\":\"Jean-François Condotta, G. Ligozat, S. Tripakis\",\"doi\":\"10.1109/ICTAI.2005.124\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider qualitative temporal or spatial constraint networks whose constraints evolve over time in an ultimately periodic fashion: after an initial stretch of time, a fixed pattern of constraints (over an interval) is reproduced indefinitely. We propose a local propagation algorithm which is polynomial, and we show that it decides the consistency problem in some particular cases. We also show that the general problem of consistency for such networks is in PSPACE\",\"PeriodicalId\":294694,\"journal\":{\"name\":\"17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05)\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-11-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICTAI.2005.124\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICTAI.2005.124","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 7

摘要

我们考虑定性的时间或空间约束网络，其约束以最终周期性的方式随着时间的推移而演变:在最初的一段时间之后，一个固定的约束模式(在一段时间内)被无限期地复制。我们提出了一种多项式局部传播算法，并证明了它在某些特殊情况下决定了一致性问题。我们还证明了这种网络的一般一致性问题存在于PSPACE中

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

查看原文本刊更多论文

Ultimately periodic qualitative constraint networks for spatial and temporal reasoning

We consider qualitative temporal or spatial constraint networks whose constraints evolve over time in an ultimately periodic fashion: after an initial stretch of time, a fixed pattern of constraints (over an interval) is reproduced indefinitely. We propose a local propagation algorithm which is polynomial, and we show that it decides the consistency problem in some particular cases. We also show that the general problem of consistency for such networks is in PSPACE

求助全文

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

来源期刊

17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05)

自引率

0.00%

发文量