Skip to main content
SpringerLink
Log in

Term matching on a mesh-connected array of processors

  • Published:
Annals of Mathematics and Artificial Intelligence Aims and scope Submit manuscript

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

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. M. Atallah and S. Hambrusch, Solving tree problems on a mesh-connected processor array, Inf. Contr. 69(1986)168–187.

    Google Scholar 

  2. A. Anderson and E. Mayr, Parallelism and greedy algorithms, Technical Report No. 84-1003, Department of Computer Science, Stanford University (1984).

  3. A.L. Delcher and S. Kasif, Term matching on a mesh-connected parallel computer,Israeli Symp. on Artificial Intelligence, Vision and Pattern Recognition (1989).

  4. A.L. Delcher and S. Kasif, Parallel term matching anti-unification,Int. Conf. on Logic Programming (1990) pp. 355–369.

  5. A.L. Delcher and S. Kasif, Efficient parallel term matching and anti-unification, J. Autom. Reasoning (1992).

  6. C. Dwork, P.C. Kanellakis and J.C. Mitchell, On the sequential nature of unification, J. Logic Progr. 1(1984)35–50.

    Google Scholar 

  7. C. Dwork, P.C. Kanellakis and L. Stockmeyer, Parallel algorithms for term matching, SIAM J. Comp. 17(1988)711–731.

    Google Scholar 

  8. S.R. Kosaraju and A.L. Delcher, A tree-partitioning technique with applications to expression evaluation and term matching,Proc. 31st Ann. Symp. on Foundations of Computer Science, St. Louis, Missouri (1990) pp. 163–172.

  9. Z.M. Kedem and K.V. Palem, Optimal parallel algorithms for forest and term matching, Technical Report, IBM Thomas J. Watson Research Center (1988), to appear in Theor. Comp. Sci.

  10. J. Maluszynski and H.J. Komorowski, Unification-free execution of Horn clause programs,Proc. 2nd Logic Symp. (1985) pp. 78–86.

  11. D. Nassimi and S. Sahni, Bitonic sort on a mesh-connected parallel computer, IEEE Trans. Comp. C-27(1979)2–7.

    Google Scholar 

  12. R. Ramesh, R.M. Verma, T. Krishnaprasad and I.V. Ramakrishnan, Term matching on parallel computers, J. Logic Progr. 6(1989)213–338.

    Google Scholar 

  13. C. Thompson and H. Kung, Sorting on a mesh-connected parallel computer, Commun. ACM 20(1977)263–271.

    Google Scholar 

  14. J.S. Vitter and R.A. Simons, New classes for parallel complexity: A study of unification and other complete problems in P, IEEE Trans. Comp. C-35(1986)403–418.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Loyola College in Maryland, 21210, Baltimore, MD, USA

    Arthur L. Delcher

  2. Department of Computer Science, The Johns Hopkins University, 21218, Baltimore, MD, USA

    Simon Kasif

Authors
  1. Arthur L. Delcher
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Simon Kasif
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This research was supported in part by NSF Grant No. IRI-9220960.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Delcher, A.L., Kasif, S. Term matching on a mesh-connected array of processors. Ann Math Artif Intell 14, 177–186 (1995). https://doi.org/10.1007/BF01530819

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01530819

Keywords

Search

Navigation