L. An Extension of the WAM for Cooperative Interval Solvers.pdfVIP

L. An Extension of the WAM for Cooperative Interval Solvers.pdf

  1. 1、本文档共16页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  5. 5、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  6. 6、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  7. 7、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  8. 8、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
L. An Extension of the WAM for Cooperative Interval Solvers

An Extension of the WAM for CooperativeInterval SolversFrederic Goualard and Laurent GranvilliersLIFO, Universite dOrleans,B.P. 6759, 45067 ORLEANS Cedex 2, FranceTel.: +33 2 38 41 72 95fFrederic.Goualard,Laurent.Granvilliersg@lifo.univ-orleans.frAbstract: We present in this paper the implementation of DecLIC, a new CLPlanguage achieving the cooperation of two di erent local consistencies, viz. hull-consistency [1] and box-consistency [3]. DecLIC is based on clp(fd) [8], a solver overFinite Domains compiling CLP programs into C via the Warren Abstract Machine(WAM) [15]. The extension of the WAM instruction set necessary to support DecLICnew features is described along with the new internal structures. A prototype hasbeen implemented and is shown to be ecient on benchmarks from various domains.Keywords: Constraint Logic Programming, CLP(Intervals) language, local consis-tency, cooperative solvers, WAM extension.1. IntroductionSince its introduction in 1987 by Cleary [6], Relational Interval Arithmetic has beenused in many CLP languages such as Prolog IV [4], clp(BNR) [11], Unicalc [12].These solvers handle complex constraints by decomposing each of them into con-junctions of \primitives (e.g. `x + y = z, `x  y = z,: : : ) as exposed in [6], andthen enforcing some consistency over all the resulting constraints through domainpropagation.The drawbacks of such a method are by now well known: introduction of newfresh variables induced by the decomposition leads to a loss of reduction of the variabledomains the user is interested in. Moreover, the constraint network thus obtained isfar more complicated than the one which would have been obtained by consideringcomplex constraints as a whole. This last point is a major problem when one wantsto inspect the constraint store for debugging or pro ling purposes. 1 2 Workshop on Parallelism and Implementation TechnologyBenhamou et al. have introduced in [3] a new consistency notion, called box-consistency, which allows |alon

文档评论(0)

l215322 + 关注
实名认证
文档贡献者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档