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
• 项目状态: 已结题
• 来源: https://kaken.nii.ac.jp/en/grant/KAKENHI-PROJECT-12480066/
• 关键词: functional logic languages; constraint solving system; computation model; narrowing calculus; completeness; Mathematica; open CFLP; collaborative system; ナローイング計算系; 求解完全性

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)配备专用求解器的约束域上的高阶函数逻辑编程。函数逻辑程序的推理是由基于高阶延迟收缩演算的专门求解器实现的；(B)通过专门代理的查找服务透明地访问专门的约束求解器；c)一种协作语言，使用户能够指定约束求解器应该协作以获得期望结果的最常见方式。这些改进非常重要，因为它们减少了巨大的解决方案搜索空间。对于(B)项，我们设计和实现了一种查找服务，允许透明地访问由开放环境(如互联网)中的提供商广告的约束求解器。用户要求具有特定界面和属性(例如，约束求解领域、求解方法等)的求解器。并且查找服务向这样的远程求解器(如果可用)产生代理。对于c语言，我们设计并实现了一个求解器协作语言，它提供了原语来描述将组件求解器组合到更高级别的约束求解过程中的最常见方法。

项目成果

T.Ida, M.Marin, T.Suzuki: "Reducing Search Space in Solving Higher-Order Equations"Lecture Notes in Artificial Intelligence. 2281. 19-30 (2002)

T.Ida、M.Marin、T.Suzuki：“在求解高阶方程时减少搜索空间”人工智能讲义。

T. Suzuki and A. Middeldorp: "A Complete Selection Function for Lazy Conditional Narrowing. In Proceedings of the 5th Symposium on Functional and Logic Programming (FLOPS 2001), LNCS 2024, Tokyo"201-215 (2001)

T. Suzuki 和 A. Middeldorp：“惰性条件缩小的完整选择函数。第五届函数和逻辑编程研讨会论文集 (FLOPS 2001)，LNCS 2024，东京”201-215 (2001)

N. Kobayashi, M. Marin, T. Ida, and Z. Che: "An Open Environment for Collaborative Constraint Functional Logic Programming. In 11th International Workshop on Functional and (Constraint) Logic Programming (WFLP2002), Grado, Italy"(2002)

N. Kobayashi、M. Marin、T. Ida 和 Z. Che：“协作约束函数逻辑编程的开放环境。第 11 届函数和（约束）逻辑编程国际研讨会 (WFLP2002)，意大利格拉多”(2002 年)

N. Kobayashi, M. Marin, Z. Che, and T. Ida: "Open CFLP : An Open System for Collaborative Constraint Functional Logic Programming. In 8th Intl. Conf. on Applications of Computer Algebra (ACA 2002), Volos, Greece"(2002)

N. Kobayashi、M. Marin、Z. Che 和 T. Ida：“Open CFLP：协作约束功能逻辑编程的开放系统。第 8 届计算机代数应用国际会议 (ACA 2002)，希腊沃洛斯

N.Kobayashi, M.Marin, Z.Che, T.Ida: "An Open System for Collaborative Constraint Functional Logic Programming"8th Intl. Conf. on Applications of Computer Algebra. (2002)

N.Kobayashi、M.Marin、Z.Che、T.Ida：“协作约束功能逻辑编程的开放系统”第 8 届国际会议