Abstract
The monadic unification problem is introduced. AnO(log2 n) parallel algorithm to solve this problem is given and shown to be correct.
Similar content being viewed by others
References
S. A. Cook,An overview of computational complexity, Comm. ACM 26, 6 (June 1983), 400–408.
R. M. Burstall and J. Darlington,A transformation system for developing recursive programs, J. ACM 24, 1 (Jan. 1977), 44–67.
C. Dwork, P. C. Kanellakis and J. C. Mitchell,On the sequential nature of unification. Unpublished, (Nov. 1983).
S. Fortune and J. Wyllie,Parallelism in random access machines, Proc. 10th Ann. ACM Symp. on Theory of Computing, (1978), 114–118.
D. S. Hirschberg, A. K. Chandra and D. V. Sarwate,Computing connected components on parallel computers, Comm. ACM 22, 8 (1979), 461–464.
D. Kapur, M. S. Krishnamoorthy and P. Narendran,A new linear unification algorithm, GE Report No. 82CRD100, (April 1982).
A. Martelli and U. Montanari,An efficient unification algorithm. Trans. on Prog. Lang. and Syst. (ACM)4, 2 (Apr. 1982), 258–282.
M. S. Paterson and M. N. Wegman,Linear unification, J. Comput. Syst. Sci. 16, 2 (Apr. 1978), 158–167.
J. A. Robinson,Computational logic: The unification computation. InMachine Intelligence, vol. 6, B. Meltzer and D. Michie (Eds.). Edinburgh Univ. Press, Edinburgh, Scotland, 1971, pp. 63–72.
J. A. Robinson,A machine-oriented logic based on the resolution principle. J. ACM 12, 1 (Jan. 1965), 23–41.
Y. Shiloach and U. Vishkin,An O(log n) parallel connectivity algorithm, J. of Algorithms 3, (1982), 57–67.
J. Wyllie,The complexity of parallel computations, Cornell U. TR 79-387, (Aug. 1979).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Auger, I.E., Krishnamoorthy, M.S. A parallel algorithm for the monadic unification problem. BIT 25, 302–306 (1985). https://doi.org/10.1007/BF01934375
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01934375