TERM MATCHING ON A MESH-CONNECTED ARRAY OF PROCESSORS

被引：0
|
作者：
DELCHER, AL [1 ]
KASIF, S [1 ]
机构：
[1] JOHNS HOPKINS UNIV,DEPT COMP SCI,BALTIMORE,MD 21218
来源：
ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE | 1995年 / 14卷 / 2-4期
关键词：
D O I：
10.1007/BF01530819
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
In this paper, we present a parallel algorithm for term matching of logical terms on a mesh-connected array of processors. Term matching is a special case of unification in which one of the terms is fully ground, i.e. contains no variables. Term matching is a fundamental computational primitive in automated reasoning and has wide applicability to logic programming and symbolic pattern matching. Our algorithm runs in O(root N) time on a root N x root N two-dimensional mesh-connected array of processors.
引用
收藏
页码：177 / 186
页数：10
相关论文
共 50 条
12345