作为推理过程的二进制CSP求解

Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence Pub Date : 1996-11-16 DOI:10.1109/TAI.1996.560786

Carlos Castro

{"title":"作为推理过程的二进制CSP求解","authors":"Carlos Castro","doi":"10.1109/TAI.1996.560786","DOIUrl":null,"url":null,"abstract":"We describe constraint solving using a rule-based approach. The distinction made between deduction rules and strategies by computational systems allows us to improve our understanding of the existing algorithms for solving binary CSPs (constraint satisfaction problems) once they are expressed as rewriting rules coordinated by strategies.","PeriodicalId":209171,"journal":{"name":"Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence","volume":"58 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Binary CSP solving as an inference process\",\"authors\":\"Carlos Castro\",\"doi\":\"10.1109/TAI.1996.560786\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We describe constraint solving using a rule-based approach. The distinction made between deduction rules and strategies by computational systems allows us to improve our understanding of the existing algorithms for solving binary CSPs (constraint satisfaction problems) once they are expressed as rewriting rules coordinated by strategies.\",\"PeriodicalId\":209171,\"journal\":{\"name\":\"Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence\",\"volume\":\"58 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1996-11-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TAI.1996.560786\",\"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 IEEE International Conference on Tools with Artificial Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TAI.1996.560786","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 7

摘要

我们使用基于规则的方法描述约束求解。计算系统对演绎规则和策略之间的区别使我们能够提高我们对解决二元csp(约束满足问题)的现有算法的理解，一旦它们被表示为由策略协调的重写规则。

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

查看原文本刊更多论文

Binary CSP solving as an inference process

We describe constraint solving using a rule-based approach. The distinction made between deduction rules and strategies by computational systems allows us to improve our understanding of the existing algorithms for solving binary CSPs (constraint satisfaction problems) once they are expressed as rewriting rules coordinated by strategies.

求助全文

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

来源期刊

Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence

自引率

0.00%

发文量