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 in O(root N) time on a root N x root N two-dimensional mesh-connected array of processors.