{"title":"生产系统匹配的约束满足","authors":"M. Perlin","doi":"10.1109/TAI.1992.246376","DOIUrl":null,"url":null,"abstract":"An attempt is made to improve production system match by incorporating the arc consistency (AC) algorithm, in the RETE algorithm. This approach combines the constraint graphs of RETE and AC into a single network, which is then incrementally updated. Empirical studies show the technique to be most efficacious with expensive rules. Thus, by using the lookahead from AC preprocessing, in many cases costly RETE computation can be effectively reduced.<<ETX>>","PeriodicalId":265283,"journal":{"name":"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Constraint satisfaction for production system match\",\"authors\":\"M. Perlin\",\"doi\":\"10.1109/TAI.1992.246376\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An attempt is made to improve production system match by incorporating the arc consistency (AC) algorithm, in the RETE algorithm. This approach combines the constraint graphs of RETE and AC into a single network, which is then incrementally updated. Empirical studies show the technique to be most efficacious with expensive rules. Thus, by using the lookahead from AC preprocessing, in many cases costly RETE computation can be effectively reduced.<<ETX>>\",\"PeriodicalId\":265283,\"journal\":{\"name\":\"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92\",\"volume\":\"25 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-11-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TAI.1992.246376\",\"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 Fourth International Conference on Tools with Artificial Intelligence TAI '92","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TAI.1992.246376","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Constraint satisfaction for production system match
An attempt is made to improve production system match by incorporating the arc consistency (AC) algorithm, in the RETE algorithm. This approach combines the constraint graphs of RETE and AC into a single network, which is then incrementally updated. Empirical studies show the technique to be most efficacious with expensive rules. Thus, by using the lookahead from AC preprocessing, in many cases costly RETE computation can be effectively reduced.<>