Global computing by networked equational constraint solvers

通过网络方程约束求解器进行全局计算

基本信息

批准号：
12480066
负责人：
IDA Tetsuo
金额：
$ 9.15万
依托单位：
University of Tsukuba
依托单位国家：
日本
项目类别：
Grant-in-Aid for Scientific Research (B)
财政年份：
2000
资助国家：
日本
起止时间：
2000 至 2002
项目状态：
已结题

项目摘要

We worked on the design and implementation of an open system for collaborative constraint solving. The outcome of our efforts is a system called Open CFLP, which provides support for collaborative constraint functional logic programming in open environments. The system provides support for(a) higher-order functional logic programming over constraint domains equipped with specialized solvers. Reasoning over functional logic programs is realized by specialized solvers based on higher-order lazy narrowing calculi ;(b) transparent access to specialized constraint solvers via the lookup service of a specialized broker ;c a collaboration language which enables the user to specify the most common ways in which constraint solvers should collaborate to achieve the desired results.For (a), we have designed and implemented in Mathematica various refinements of higher-order lazy narrowing which are relevant for programming purposes. These refinements are very important because they reduce the huge search space for solutions. For (b), we have designed and implemented a lookup service that allows transparent access to constraint solvers advertised by providers in an open environment such as the Internet. The user asks for a solver characterized by a certain interface and attributes (e.g., constraint solving domain, solving method, etc.) and the lookup service yields a proxy to such a remote solver (if available). For c, we have designed and implemented a solver collaboration language which provides primitives to describe the most common ways to combine component solvers into a higher-level constraint solving procedure.

我们从事开放系统的设计和实施，用于协作解决方案。我们努力的结果是一个名为Open CFLP的系统，该系统为开放环境中的协作约束功能逻辑编程提供了支持。该系统为（a）高阶功能逻辑编程提供支持，而不是配备专用求解器的约束域。功能逻辑程序的推理是由基于高阶懒惰狭窄的calculi的专业求解器实现的；（b）通过专业经纪人的查找服务透明地访问专门的约束求解器； c协作语言，使用户可以指定最常见的方式在哪个约束求解器应协作以实现所需结果的情况下。对于（a），我们在Mathematica中设计和实施了高阶懒惰狭窄的各种改进，这与编程目的有关。这些改进非常重要，因为它们减少了解决方案的巨大搜索空间。对于（b），我们设计和实施了一项查找服务，该服务允许在开放环境（例如Internet）中宣传的约束求解器透明化访问权限。用户要求一个以某个接口和属性（例如，约束求解域，求解方法等）为特征的求解器，并且查找服务可为远程求解器（如果可用）产生代理。对于C，我们设计并实施了一种求解器协作语言，该语言提供了原始方法来描述将组件求解器组合到更高级别的约束解决过程中的最常见方法。