{"title":"Automatic analysis of composite solvers","authors":"E. Petrov, É. Monfroy","doi":"10.1109/TAI.2002.1180815","DOIUrl":null,"url":null,"abstract":"Cooperative constraint solving is an area of constraint programming which develops and studies methods for organizing interaction between constraint solvers. The goal of research in cooperative constraint solving is to discover the interaction patterns which amplify the positive qualities of individual constraint solvers. Analysis of composite solvers is a theoretically and practically important issue in cooperative constraint solving. In this paper we present an analysis by means of set constraints which allows one to reason about the behaviour of composite solvers in terms of pre- and post-conditions.","PeriodicalId":197064,"journal":{"name":"14th IEEE International Conference on Tools with Artificial Intelligence, 2002. (ICTAI 2002). Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2002-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"14th IEEE International Conference on Tools with Artificial Intelligence, 2002. (ICTAI 2002). Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TAI.2002.1180815","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Cooperative constraint solving is an area of constraint programming which develops and studies methods for organizing interaction between constraint solvers. The goal of research in cooperative constraint solving is to discover the interaction patterns which amplify the positive qualities of individual constraint solvers. Analysis of composite solvers is a theoretically and practically important issue in cooperative constraint solving. In this paper we present an analysis by means of set constraints which allows one to reason about the behaviour of composite solvers in terms of pre- and post-conditions.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
复合解算器的自动分析
协同约束求解是约束规划的一个领域,它发展和研究了约束求解器之间相互作用的组织方法。合作约束求解的研究目标是发现能够放大个体约束求解者的积极品质的交互模式。复合求解器的分析是协同约束求解中一个重要的理论和实践问题。在本文中,我们提出了一种利用集合约束的分析方法,它允许人们根据前置和后置条件来推理复合解算器的行为。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Machine learning for software engineering: case studies in software reuse Active tracking and cloning of facial expressions using spatio-temporal information Fusing cooperative technical-specification knowledge components Ontology construction for information selection An intelligent brokering system to support multi-agent Web-based 4/sup th/-party logistics
×
引用
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