RUI: Highly Parallel Constraint Logic Programming for AI and MIP Applications

RUI：适用于 AI 和 MIP 应用的高度并行约束逻辑编程

• 批准号: 9115603
• 负责人: Ken McAloon
• 金额: $ 13.64万
• 依托单位: CUNY Brooklyn College
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 1992
• 资助国家: 美国
• 起止时间: 1992-08-01 至 1995-01-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=9115603&HistoricalAwards=false
• 关键词: RUI; Highly; Parallel; Constraint; Logic

This research has a three-fold goal: (1) to develop tools for building intelligent systems that require tightly coupled logical and numerical computation; (2) to apply mathematical programming and constrained optimization techniques to do logical inference and, (3) to test the efficacy of highly parallel constraint logic programming systems in this arena. Constraint logic programming (CLP) provides a natural paradigm to link logical computation and numerical computation. This research is based on compact CLP languages which are supersets of linear and integer programming and support the data structures necessary for mathematical programming rather than on constraint based extensions to Prolog. The fit between the applications and constraint logic programming opens up several avenues for parallelism, since logic programming systems have direct hooks into both or-parallelism and and-parallelism.

这项研究有三个目标：（1）开发用于构建需要紧密耦合的逻辑和数值计算的智能系统的工具； (2) 应用数学编程和约束优化技术进行逻辑推理，(3) 测试高度并行约束逻辑编程系统在该领域的功效。 约束逻辑编程（CLP）提供了连接逻辑计算和数值计算的自然范例。 这项研究基于紧凑的 CLP 语言，它是线性和整数规划的超集，支持数学规划所需的数据结构，而不是基于 Prolog 的基于约束的扩展。 应用程序和约束逻辑编程之间的配合为并行性开辟了多种途径，因为逻辑编程系统可以直接挂钩或并行性和与并行性。