A note on the parallel complexity of anti-unification

The anti-unifier is the dual notion to the unifier, i.e., it is the most specific term that has the input terms as instances. We show that the problem of anti-unification is in NC, in contrast to unification that is known to be P-complete.

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

[2]  Nicholas Pippenger,et al.  On simultaneous resource bounds , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[3]  I. V. Ramakrishnan,et al.  Term Matching on Parallel Computers , 1989, J. Log. Program..

[4]  Richard Cole,et al.  Approximate and exact parallel scheduling with applications to list, tree and graph problems , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[5]  Uzi Vishkin,et al.  Optimal parallel generation of a computation tree form , 1985, TOPL.

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

[7]  Richard Cole,et al.  Parallel merge sort , 1988, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[8]  Cynthia Dwork,et al.  Parallel Algorithms for Term Matching , 1988, SIAM J. Comput..

[9]  John C. Mitchell,et al.  On the Sequential Nature of Unification , 1984, J. Log. Program..

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