On the Sequential Nature of Unification

Abstract The problem of unification of terms is log-space complete for P. In deriving this lower bound no use is made of the potentially concise representation of terms by directed acyclic graphs. In addition, the problem remains complete even if infinite substitutions are allowed. A consequence of this result is that parallelism cannot significantly improve on the best sequential solutions for unification. However, we show that for the problem of term matching, an important subcase of unification, there is a good parallel algorithm using O ( log 2 n ) time and n O(1) processors on a PRAM. For the O ( log 2 n ) parallel time upper bound we assume that the terms are represented by directed acyclic graphs; if the longer string representation is used we obtain an O ( log n ) parallel time bound.

[1]  Alberto Martelli,et al.  An Efficient Unification Algorithm , 1982, TOPL.

[2]  J. A. Robinson,et al.  A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[3]  Deepak Kapur,et al.  On Proving Uniform Termination and Restricted Termination of Rewriting Systems , 1983, SIAM J. Comput..

[4]  Hiroto Yasuura,et al.  On Parallel Computational Complexity of Unification , 1984, Fifth Generation Computer Systems.

[5]  Mike Paterson,et al.  Linear unification , 1976, STOC '76.

[6]  William F. Clocksin,et al.  Programming in Prolog , 1981, Springer Berlin Heidelberg.

[7]  Robin Milner,et al.  A Theory of Type Polymorphism in Programming , 1978, J. Comput. Syst. Sci..

[8]  Dilip V. Sarwate,et al.  Computing connected components on parallel computers , 1979, CACM.

[9]  Robert E. Tarjan,et al.  Variations on the Common Subexpression Problem , 1980, J. ACM.

[10]  Dexter Kozen,et al.  Complexity of finitely presented algebras , 1977, STOC '77.

[11]  Gordon D. Plotkin,et al.  An ideal model for recursive polymorphic types , 1984, Inf. Control..

[12]  L. Goldschlager.  The monotone and planar circuit value problems are log space complete for P , 1977, SIGA.

[13]  Steven Fortune,et al.  Parallelism in random access machines , 1978, STOC.

[14]  John Staples,et al.  The Maximum Flow Problem is Log Space Complete for P , 1982, Theor. Comput. Sci..

[15]  Richard Statman,et al.  Unifiability is Complete for co-NLogSpace , 1982, Inf. Process. Lett..