Term matching on a mesh-connected array of processors

Arthur L. Delcher, Simon Kasif

Research output: Contribution to journalArticle

Abstract

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
Volume14
Issue number2-4
DOIs
StatePublished - Jun 1995
Externally publishedYes

Fingerprint

Logic programming
Pattern matching
Parallel algorithms
Mesh
Term
Automated Reasoning
Pattern Matching
Logic Programming
Unification
Parallel Algorithms

ASJC Scopus subject areas

  • Applied Mathematics
  • Artificial Intelligence

Cite this

Term matching on a mesh-connected array of processors. / Delcher, Arthur L.; Kasif, Simon.

In: Annals of Mathematics and Artificial Intelligence, Vol. 14, No. 2-4, 06.1995, p. 177-186.

Research output: Contribution to journalArticle

Delcher, Arthur L. ; Kasif, Simon. / Term matching on a mesh-connected array of processors. In: Annals of Mathematics and Artificial Intelligence. 1995 ; Vol. 14, No. 2-4. pp. 177-186.
@article{2b1004ba867548ecb89018047f781140,
title = "Term matching on a mesh-connected array of processors",
abstract = "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.",
author = "Delcher, {Arthur L.} and Simon Kasif",
year = "1995",
month = "6",
doi = "10.1007/BF01530819",
language = "English (US)",
volume = "14",
pages = "177--186",
journal = "Annals of Mathematics and Artificial Intelligence",
issn = "1012-2443",
publisher = "Springer Netherlands",
number = "2-4",

}

TY - JOUR

T1 - Term matching on a mesh-connected array of processors

AU - Delcher, Arthur L.

AU - Kasif, Simon

PY - 1995/6

Y1 - 1995/6

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=34249758216&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34249758216&partnerID=8YFLogxK

U2 - 10.1007/BF01530819

DO - 10.1007/BF01530819

M3 - Article

AN - SCOPUS:34249758216

VL - 14

SP - 177

EP - 186

JO - Annals of Mathematics and Artificial Intelligence

JF - Annals of Mathematics and Artificial Intelligence

SN - 1012-2443

IS - 2-4

ER -