可因子关系的弧一致性

[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91 Pub Date : 1991-11-10 DOI:10.1109/TAI.1991.167113

M. Perlin

{"title":"可因子关系的弧一致性","authors":"M. Perlin","doi":"10.1109/TAI.1991.167113","DOIUrl":null,"url":null,"abstract":"An optimal arc consistency algorithm AC-4 was given by R. Mohr and T.C. Henderson (1986). AC-4 has costO(ea/sup 2/), and cost(na/sup 2/) for scene labeling. Although their algorithm is indeed optimal, under certain conditions a constraint satisfaction problem can be transformed into a less complex problem. Conditions and mechanisms are presented for such transformations, and it is shown how to factor relations into more manageable components. A description is given of how factorization can reduce AC-4's cost to O(ea), and this result is applied to RETE match.<<ETX>>","PeriodicalId":371778,"journal":{"name":"[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"41","resultStr":"{\"title\":\"Arc consistency for factorable relations\",\"authors\":\"M. Perlin\",\"doi\":\"10.1109/TAI.1991.167113\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An optimal arc consistency algorithm AC-4 was given by R. Mohr and T.C. Henderson (1986). AC-4 has costO(ea/sup 2/), and cost(na/sup 2/) for scene labeling. Although their algorithm is indeed optimal, under certain conditions a constraint satisfaction problem can be transformed into a less complex problem. Conditions and mechanisms are presented for such transformations, and it is shown how to factor relations into more manageable components. A description is given of how factorization can reduce AC-4's cost to O(ea), and this result is applied to RETE match.<<ETX>>\",\"PeriodicalId\":371778,\"journal\":{\"name\":\"[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91\",\"volume\":\"39 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-11-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"41\",\"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.167113\",\"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 Conference on Tools for Artificial Intelligence - TAI 91","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TAI.1991.167113","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 41

摘要

R. Mohr和T.C. Henderson(1986)给出了最优弧一致性算法AC-4。AC-4有cost(ea/sup 2/)和cost(na/sup 2/)用于场景标注。虽然他们的算法确实是最优的，但在一定条件下，约束满足问题可以转化为不那么复杂的问题。介绍了这种转换的条件和机制，并展示了如何将关系分解为更易于管理的组件。描述了因式分解如何将AC-4的成本降低到0 (ea)，并将此结果应用于RETE匹配。

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

查看原文本刊更多论文

Arc consistency for factorable relations

An optimal arc consistency algorithm AC-4 was given by R. Mohr and T.C. Henderson (1986). AC-4 has costO(ea/sup 2/), and cost(na/sup 2/) for scene labeling. Although their algorithm is indeed optimal, under certain conditions a constraint satisfaction problem can be transformed into a less complex problem. Conditions and mechanisms are presented for such transformations, and it is shown how to factor relations into more manageable components. A description is given of how factorization can reduce AC-4's cost to O(ea), and this result is applied to RETE match.<>

求助全文

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

来源期刊

[Proceedings] Third International Conference on Tools for Artificial Intelligence - TAI 91

自引率

0.00%

发文量