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 条
  • [21] Prolog machine based on VLSI algorithms
    Shobatake, Yasuro, 1600, (20):
  • [22] Abstract interpretation of Prolog programs
    Spoto, F
    Levi, G
    ALGEBRAIC METHODOLOGY AND SOFTWARE TECHNOLOGY, 1999, 1548 : 455 - 470
  • [23] AN ABSTRACT SCHEME FOR A PARALLEL LOGICAL INFERENCE MACHINE
    VAGIN, VN
    VASILYEV, MYU
    SOVIET JOURNAL OF COMPUTER AND SYSTEMS SCIENCES, 1989, 27 (02): : 18 - 25
  • [24] DESIGN AND FORMAL SPECIFICATION OF A PARALLEL ABSTRACT MACHINE
    LEE, MKO
    COMPUTING AND INFORMATION, 1989, : 193 - 200
  • [25] An abstract machine for prototyping parallel proof mechanisms
    Johnson, R
    Shen, K
    Fisher, M
    Keane, J
    Nisbet, A
    ABSTRACT MACHINE MODELS FOR PARALLEL AND DISTRIBUTED COMPUTING, 1996, : 191 - 202
  • [26] AND-OR PARALLEL PROLOG - A RECOMPUTATION BASED APPROACH
    GUPTA, G
    HERMENEGILDO, MV
    COSTA, VS
    NEW GENERATION COMPUTING, 1993, 11 (3-4) : 297 - 321
  • [27] ABSTRACT INTERPRETATION OF PROLOG PROGRAMS
    MELLISH, CS
    LECTURE NOTES IN COMPUTER SCIENCE, 1986, 225 : 463 - 474
  • [28] A PARALLEL LOGIC SIMULATOR BASED ON CONCURRENT PROLOG
    NODA, Y
    KINOSHITA, T
    OKUMURA, A
    HIRANO, T
    HIRUTA, T
    LECTURE NOTES IN COMPUTER SCIENCE, 1986, 221 : 256 - 265
  • [29] REEXECUTION IN ABSTRACT INTERPRETATION OF PROLOG
    LECHARLIER, B
    VANHENTENRYCK, P
    ACTA INFORMATICA, 1995, 32 (03) : 209 - 253
  • [30] OR-PARALLEL PROLOG IN FLAT CONCURRENT PROLOG
    SHAPIRO, E
    JOURNAL OF LOGIC PROGRAMMING, 1989, 6 (03): : 243 - 267