Term matching on a mesh-connected array of processors

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 inO(√N) time on a √N×√N two-dimensional mesh-connected array of processors.

[1]  Sartaj Sahni,et al.  Bitonic Sort on a Mesh-Connected Parallel Computer , 1979, IEEE Transactions on Computers.

[2]  Jan Maluszynski,et al.  Unification-Free Execution of Logic Programs , 1985, SLP.

[3]  Krishna V. Palem,et al.  Optimal Parallel Algorithms for Forest and Term Matching , 1992, Theor. Comput. Sci..

[4]  S. Rao Kosaraju,et al.  A tree-partitioning technique with applications to expression evaluation and term matching , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[5]  I. V. Ramakrishnan,et al.  Term Matching on Parallel Computers , 1989, J. Log. Program..

[6]  Jeffrey Scott Vitter,et al.  New Classes for Parallel Complexity: A Study of Unification and Other Complete Problems for P , 1986, IEEE Transactions on Computers.

[7]  H. T. Kung,et al.  Sorting on a mesh-connected parallel computer , 1977, CACM.

[8]  Richard J. Anderson,et al.  Parallelism and greedy algorithms , 1984 .

[9]  Simon Kasif,et al.  Efficient parallel term matching and anti-unification , 2004, Journal of Automated Reasoning.

[10]  John C. Mitchell,et al.  On the Sequential Nature of Unification , 1984, J. Log. Program..

[11]  Mikhail J. Atallah,et al.  Solving tree problems on a mesh-connected processor array , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[12]  Cynthia Dwork,et al.  Parallel Algorithms for Term Matching , 1988, SIAM J. Comput..