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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bar-OnI. and VishkinU., ‘Optimal parallel generation of a computation tree form’, ACM TOPLAS 7(2), 348–357 (1985).
Cole, R., ‘Parallel merge sort’, in Proc. 27th Annual IEEE Symposium on Foundations of Computer Science, IEEE, pp. 511–516 (1986).
Cole, R. and Vishkin, U., ‘Approximate and exact scheduling with applications to list, tree and graph problems’, in Proc. 27th Annual IEEE Symposium on Foundations of Computer Science, IEEE, pp. 478–491 (1986).
DworkC., KanellakisP., and MitchellC., ‘On the sequential nature of unification’, J. Logic Programming 1, 35–50 (1984).
DworkC., KanellakisP., and StockmeyerL., ‘Parallel algorithms for term matching’, SIAM J. Comput. 17(4), 711–731 (1988).
Fortune, S. and Wyllie, J., ‘Parallelism in random access machines’, in Proc. 10th Annual ACM Symp. on Theory of Computing, ACM, pp. 114–118 (1978).
Huet, G., ‘Resolution d'Equations dans des Languages d'Order 1, 2, ..., w’, Ph.D. thesis, Université de Paris VII (1976).
MartelliA. and MontanariU., ‘An efficient unification algorithm’, Trans. Programming Languages and Systems 4(2), 258–282 (1982).
Marriott, K., Naish, L., and Lassez, J.-L., Most Specific Logic Programs, ICLP, pp. 909–923 (1988).
Pippenger, N., ‘On simultaneous resource bounds’, in Proc. 20th Annual IEEE Symp. on Foundations of Comp. Sci., IEEE, pp. 307–311 (1979).
Plotkin, G., ‘A note on inductive generalization’, in Machine Intelligence 5 (eds. B. Meltzer and D. Michie), pp. 153–163 (1970).
PatersonM. and WegmanM., ‘Linear unification’, J. Comp. System Sci. 16(2), 158–167 (1978).
Reynolds, J., ‘Transformations on inductive generalization’, in Machine Intelligence 6 (eds. B. Meltzer and D. Michie), pp. 101–124 (1971).
RameshR., VermaR. M., KrishnaprasadT., and RamakrishnanI. V., ‘Term matching on parallel computers’, J. Logic Programming 6(3), 213–218 (1989).
Vishkin, U., ‘Synchronous Parallel Computation — A Survey’, Tech. Rep. Courant Inst., New York Univ. (1983).
Yasuura, H., ‘On the parallel computational complexity of unification’, Tech. Rep. TR83-01, Yajima Lab. (1983).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kuper, G.M., McAloon, K.W., Palem, K.V. et al. A note on the parallel complexity of anti-unification. Journal of Automated Reasoning 9, 381–389 (1992). https://doi.org/10.1007/BF00245297
Issue Date:
DOI: https://doi.org/10.1007/BF00245297