{"title":"Houria约束求解器","authors":"M. Bouzoubaa","doi":"10.2495/AI950241","DOIUrl":null,"url":null,"abstract":"The Houria constraint solver is an efficient incremental algorithm that uses local propagation to maintain sets of required and preferential constraints. Houria represents constraints between variables by sets of short procedures (methods) and incrementally resatisftes the set of constraints when individual constraints are added and removed. The criterion of comparison used in Houria is more powerful than that of some other solvers. Houria is used to construct a graph of methods by planning and executing all these methods to found a best solution. The solution found by Houria satisfies more constraints than the one produced by some other solvers and that for the same over-constrained problems while respecting the hierarchy.","PeriodicalId":322432,"journal":{"name":"Scandinavian Conference on AI","volume":"51 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"The Houria Constraint Solver\",\"authors\":\"M. Bouzoubaa\",\"doi\":\"10.2495/AI950241\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Houria constraint solver is an efficient incremental algorithm that uses local propagation to maintain sets of required and preferential constraints. Houria represents constraints between variables by sets of short procedures (methods) and incrementally resatisftes the set of constraints when individual constraints are added and removed. The criterion of comparison used in Houria is more powerful than that of some other solvers. Houria is used to construct a graph of methods by planning and executing all these methods to found a best solution. The solution found by Houria satisfies more constraints than the one produced by some other solvers and that for the same over-constrained problems while respecting the hierarchy.\",\"PeriodicalId\":322432,\"journal\":{\"name\":\"Scandinavian Conference on AI\",\"volume\":\"51 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Scandinavian Conference on AI\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2495/AI950241\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Scandinavian Conference on AI","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2495/AI950241","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The Houria constraint solver is an efficient incremental algorithm that uses local propagation to maintain sets of required and preferential constraints. Houria represents constraints between variables by sets of short procedures (methods) and incrementally resatisftes the set of constraints when individual constraints are added and removed. The criterion of comparison used in Houria is more powerful than that of some other solvers. Houria is used to construct a graph of methods by planning and executing all these methods to found a best solution. The solution found by Houria satisfies more constraints than the one produced by some other solvers and that for the same over-constrained problems while respecting the hierarchy.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
