AN ABSTRACT PROLOG MACHINE BASED ON PARALLEL RESOLUTION PRINCIPLE

被引:1
|
作者
VLAHAVAS, I [1 ]
KEFALAS, P [1 ]
机构
[1] ARISTOTELIAN UNIV SALONIKA,DEPT PHYS,DIGITAL SYST & COMP LAB,GR-5400L SALONIKA,GREECE
来源
MICROPROCESSING AND MICROPROGRAMMING | 1992年 / 35卷 / 1-5期
关键词
D O I
10.1016/0165-6074(92)90399-R
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
We describe an abstract machine, called SPUM, for the AND parallel execution of Prolog programs. We also present a resolution algorithm for logic programs, on which the SPUM architecture is based. The algorithm, called SPU, is based on parallel resolution principle and allows parallel execution of unifications of a deterministic path of the proof tree, giving in effect dependent and-parallelism. We also present preliminary results which are indicative of the performance expected from SPUM.
引用
收藏
页码:755 / 762
页数:8
相关论文
共 50 条