About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
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.