RAP/LOP-WAM并行推理机的编译器设计  

DESIGN OF A COMPILER FOR THE RAP/LOP-WAM PARALLEL INFERENCE MACHINE

作　　者：高耀清 刘志宏[1] 胡守仁[1] 

机构地区：[1]国防科技大学

出　　处：《计算机工程》1990年第6期25-30,共6页Computer Engineering

基　　金：霍英东教育基金资助

摘　　要：RAP/LOP-WAM并行推理机基于OR树林描述,扩展WAM,开展逻辑程序的限制与/或并行性。本文论述了RAP/LOP-WAM编译器的设计思想和方法,它将逻辑程序转换成高效的并行抽象机指令。The RAP/LOP-WAM parallel inference machine is based on the OR-forest description and is an extension of the WAM. It supports Restricted AND-Parallelism and Limited OR-Parallelism of logic programs. This paper presents the design ideas and methods of the compiler which translates logic programs into the parallel abstract instruction set efficiently.

关 键 词：并行推理机 编译器 逻辑程序 

分 类 号：TP387[自动化与计算机技术—计算机系统结构]