Term matching on a mesh-connected array of processors

Arthur L. Delcher, Simon Kasif

Research output: Contribution to journalArticlepeer-review


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

Original languageEnglish (US)
Pages (from-to)177-186
Number of pages10
JournalAnnals of Mathematics and Artificial Intelligence
Issue number2-4
StatePublished - Jun 1 1995

ASJC Scopus subject areas

  • Artificial Intelligence
  • Applied Mathematics


Dive into the research topics of 'Term matching on a mesh-connected array of processors'. Together they form a unique fingerprint.

Cite this