{"title":"有序域上的约束传播","authors":"B. Li, E. Burke, D. Elliman","doi":"10.1109/CAIA.1992.200008","DOIUrl":null,"url":null,"abstract":"A new algorithm is described for propagating constraints over ordered domains. The method is particularly suitable for applications where variables may be restricted to a sequence of contiguous values within a domain. By describing the characteristics of the domains, and adding variables and constraints, it is possible to specify a wide variety of problems in a simple and intuitive way. The algorithm may then be invoked to limit the solution space. It is particularly suitable for interactive use, with the user modifying the ranges of variables and then invoking constraint propagation to establish all consequences.<<ETX>>","PeriodicalId":388685,"journal":{"name":"Proceedings Eighth Conference on Artificial Intelligence for Applications","volume":"109 3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Constraint propagation over ordered domains\",\"authors\":\"B. Li, E. Burke, D. Elliman\",\"doi\":\"10.1109/CAIA.1992.200008\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new algorithm is described for propagating constraints over ordered domains. The method is particularly suitable for applications where variables may be restricted to a sequence of contiguous values within a domain. By describing the characteristics of the domains, and adding variables and constraints, it is possible to specify a wide variety of problems in a simple and intuitive way. The algorithm may then be invoked to limit the solution space. It is particularly suitable for interactive use, with the user modifying the ranges of variables and then invoking constraint propagation to establish all consequences.<<ETX>>\",\"PeriodicalId\":388685,\"journal\":{\"name\":\"Proceedings Eighth Conference on Artificial Intelligence for Applications\",\"volume\":\"109 3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-03-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Eighth Conference on Artificial Intelligence for Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CAIA.1992.200008\",\"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 Eighth Conference on Artificial Intelligence for Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CAIA.1992.200008","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A new algorithm is described for propagating constraints over ordered domains. The method is particularly suitable for applications where variables may be restricted to a sequence of contiguous values within a domain. By describing the characteristics of the domains, and adding variables and constraints, it is possible to specify a wide variety of problems in a simple and intuitive way. The algorithm may then be invoked to limit the solution space. It is particularly suitable for interactive use, with the user modifying the ranges of variables and then invoking constraint propagation to establish all consequences.<>
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
