Improving Han and Lee's path consistency algorithm

Yangjun Chen
{"title":"Improving Han and Lee's path consistency algorithm","authors":"Yangjun Chen","doi":"10.1109/TAI.1991.167114","DOIUrl":null,"url":null,"abstract":"C.C. Han and C.H. Lee (1988) presented a path consistency algorithm. A new algorithm is described for path consistency, and it is shown that the algorithm requires less time and space than Han and Lee's. The key idea of the algorithms is the arranging of the edges which are checked in the first part of Han and Lee's algorithm and the interlacing of the second part of the algorithm in the first part by using the symmetry of the triangle.<<ETX>>","PeriodicalId":371778,"journal":{"name":"[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TAI.1991.167114","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13

Abstract

C.C. Han and C.H. Lee (1988) presented a path consistency algorithm. A new algorithm is described for path consistency, and it is shown that the algorithm requires less time and space than Han and Lee's. The key idea of the algorithms is the arranging of the edges which are checked in the first part of Han and Lee's algorithm and the interlacing of the second part of the algorithm in the first part by using the symmetry of the triangle.<>
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
改进Han和Lee的路径一致性算法
C.C. Han和C.H. Lee(1988)提出了一种路径一致性算法。提出了一种新的路径一致性算法,与Han和Lee的算法相比,该算法需要更少的时间和空间。该算法的核心思想是利用三角形的对称性对Han和Lee算法第一部分检查的边进行排列,并在第一部分中对算法的第二部分进行隔行。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
AUTOTEC: an English to Chinese machine translation system Backward assembly planning An event-based real-time logic to specify the behavior and timing properties of real-time systems Feature-based design evaluation through constraint structure unification Extending the learnability of decision trees
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1