Summary
Further asymptotical improvement of original Robinson's unification idea is presented. By postponing the so-called occur-check in Corbin and Bidoit's quadratic rehabilitation of the Robinson algorithm at the end of unification an almost linear unification algorithm is obtained. In the worst case, the resulting algorithm has the time complexity O(p · A(p)), where p is the size of input terms and A is the inverse to the Ackermann function. Moreover, the practical experiments are summarized comparing Corbin and Bidoit's quadratic algorithm with the resulting almost linear unification algorithm based on Robinson's principle.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Corbin, J., Bidoit, M.: A rehabilitation of Robinson's unification algorithm. In: Mason, R.E.A. (ed.) Information Processing 83. Amsterdam: Elsevier/North-Holland, pp. 909–914 (1983)
Martelli, A., Montanari, V.: An efficient unification algorithm. Trans. Program. Languages Syst. 4, 258–282 (1982)
Paterson, M.S., Wegman, M.N.: Linear unification. J. Comput. Syst. Sci. 16, 158–167 (1978)
Prívara, I.: PROGRESS — a system supporting design and prototyping of algebraic specifications. Technical Report OPS-6-88, VUSEI-AR Bratislava 1988
Robinson, J.A.: A machine-oriented logic based on the resolution principle. J. ACM 12, 23–41 (1965)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ružička, P., Prívara, I. An almost linear Robinson unification algorithm. Acta Informatica 27, 61–71 (1989). https://doi.org/10.1007/BF00263501
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00263501