Houria约束求解器

M. Bouzoubaa
{"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}
引用次数: 3

摘要

Houria约束求解器是一种有效的增量算法,它使用局部传播来维护所需和优先约束集。Houria通过一组短过程(方法)表示变量之间的约束,并在添加和删除单个约束时增量地重新满足约束集。《Houria》所使用的比较标准比其他解算器更强大。Houria用于通过规划和执行所有这些方法来构建方法图,以找到最佳解决方案。Houria找到的解比其他求解器得到的解满足更多的约束条件,并且在尊重层次结构的情况下满足同样的过度约束问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
The Houria Constraint Solver
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Goal-driven, assistive agents for instructing and guiding user activities On Associative Confounder Bias Heuristics for Determining the Elimination Ordering in the Influence Diagram Evaluation with Binary Trees Revisiting Inner Entanglements in Classical Planning Error AMP Chain Graphs
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1