Term matching on a mesh-connected array of processors

Arthur L. Delcher; Simon Kasif

doi:10.1007/BF01530819

Term matching on a mesh-connected array of processors

Arthur L. Delcher, Simon Kasif

Research output: Contribution to journal › Article › peer-review

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 language	English (US)
Pages (from-to)	177-186
Number of pages	10
Journal	Annals of Mathematics and Artificial Intelligence
Volume	14
Issue number	2-4
DOIs	https://doi.org/10.1007/BF01530819
State	Published - Jun 1995
Externally published	Yes

ASJC Scopus subject areas

Artificial Intelligence
Applied Mathematics

Access to Document

10.1007/BF01530819

Cite this

@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 = jun,

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

SN - 1012-2443

VL - 14

SP - 177

EP - 186

JO - Annals of Mathematics and Artificial Intelligence

JF - Annals of Mathematics and Artificial Intelligence

IS - 2-4

ER -

Term matching on a mesh-connected array of processors

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this