Publication
Journal of Automated Reasoning
Paper
A note on the parallel complexity of anti-unification
Abstract
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. © 1992 Kluwer Academic Publishers.