一种新的分层域csp的弧一致性算法

Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94 Pub Date : 1994-11-06 DOI:10.1109/TAI.1994.346459

T. Kokeny

{"title":"一种新的分层域csp的弧一致性算法","authors":"T. Kokeny","doi":"10.1109/TAI.1994.346459","DOIUrl":null,"url":null,"abstract":"General arc-consistency filtering techniques for constraint satisfaction problems (CSP) can be improved by considering special CSP classes. A domain hierarchical CSP is a CSP in which an intrinsic hierarchical structure of its domains is known. A.K. Mackworth et al. (1985) proposed an are consistency algorithm for domain hierarchical CSPs (HAC) whose worst-case time complexity was 0(md/sup 3/) where m is the number of constraints and d is the maximal size of a domain. HAC worked only with binary tree structured domains. In this paper we present HAC-6 a new arc-consistency algorithm for domain hierarchical CSPs which works with all types of domain hierarchies (any partial ordering) and its worst-case complexity is 0(md/sup 2/). HAC-6 is based on AC-6 which is the best at present, worst-case optimal arc-consistency algorithm for classical CSPs.<<ETX>>","PeriodicalId":262014,"journal":{"name":"Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A new arc consistency algorithm for CSPs with hierarchical domains\",\"authors\":\"T. Kokeny\",\"doi\":\"10.1109/TAI.1994.346459\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"General arc-consistency filtering techniques for constraint satisfaction problems (CSP) can be improved by considering special CSP classes. A domain hierarchical CSP is a CSP in which an intrinsic hierarchical structure of its domains is known. A.K. Mackworth et al. (1985) proposed an are consistency algorithm for domain hierarchical CSPs (HAC) whose worst-case time complexity was 0(md/sup 3/) where m is the number of constraints and d is the maximal size of a domain. HAC worked only with binary tree structured domains. In this paper we present HAC-6 a new arc-consistency algorithm for domain hierarchical CSPs which works with all types of domain hierarchies (any partial ordering) and its worst-case complexity is 0(md/sup 2/). HAC-6 is based on AC-6 which is the best at present, worst-case optimal arc-consistency algorithm for classical CSPs.<<ETX>>\",\"PeriodicalId\":262014,\"journal\":{\"name\":\"Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-11-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TAI.1994.346459\",\"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 Sixth International Conference on Tools with Artificial Intelligence. TAI 94","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TAI.1994.346459","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

约束满足问题的一般弧一致性滤波技术可以通过考虑特殊的CSP类而得到改进。域分层CSP是一种已知域的固有层次结构的CSP。A.K. Mackworth等人(1985)提出了一种域层次csp (HAC)的一致性算法，其最坏情况时间复杂度为0(md/sup 3/)，其中m为约束数，d为域的最大大小。HAC只适用于二叉树结构域。本文提出了一种新的适用于所有类型(任意偏序)域分层csp的弧一致性算法HAC-6，其最坏情况复杂度为0(md/sup 2/)。HAC-6是在AC-6的基础上提出的，AC-6是目前最优、最坏情况下最优的经典csp弧一致性算法

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

查看原文本刊更多论文

A new arc consistency algorithm for CSPs with hierarchical domains

General arc-consistency filtering techniques for constraint satisfaction problems (CSP) can be improved by considering special CSP classes. A domain hierarchical CSP is a CSP in which an intrinsic hierarchical structure of its domains is known. A.K. Mackworth et al. (1985) proposed an are consistency algorithm for domain hierarchical CSPs (HAC) whose worst-case time complexity was 0(md/sup 3/) where m is the number of constraints and d is the maximal size of a domain. HAC worked only with binary tree structured domains. In this paper we present HAC-6 a new arc-consistency algorithm for domain hierarchical CSPs which works with all types of domain hierarchies (any partial ordering) and its worst-case complexity is 0(md/sup 2/). HAC-6 is based on AC-6 which is the best at present, worst-case optimal arc-consistency algorithm for classical CSPs.<>

求助全文

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

来源期刊

Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94

自引率

0.00%

发文量