Abstract
In this paper we prove the completeness of unification based on basic narrowing. First we prove the completeness of unification based on original narrowing under a weaker condition than the previous proof. Then we discuss the relation between basic narrowing and innermost reduction as the lifting lemma, and prove the completeness of unification based on basic narrowing. Moreover, we give the switching lemma to combine the previous algorithm and our new proof.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Bosco, P.G., Giovannetti, E., and Moiso, C. (1987): Refined Strategies for Semantic Unification, Proc. TAPSOFT '87 (LNCS 250), 276–290.
Hullot, J.M. (1980): Canonical Forms and Unification, Proc. 5th Conference on Automated Deduction (LNCS 87), 318–334.
Lloyd, J.W. (1984): Foundations of Logic Programming, Springer-Verlag.
Martelli, A. and Montanari, U. (1982): An Efficient Unification Algorithm, ACM TOPLAS, 4(2), 258–282.
Yamamoto, A. (1987): A Theoretical Combination of SLD-Resolution and Narrowing, Proc. 4th ICLP, 470–487.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yamamoto, A. (1989). Completeness of extended unification based on basic narrowing. In: Furukawa, K., Tanaka, H., Fujisaki, T. (eds) Logic Programming '88. LP 1988. Lecture Notes in Computer Science, vol 383. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51564-X_51
Download citation
DOI: https://doi.org/10.1007/3-540-51564-X_51
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51564-7
Online ISBN: 978-3-540-46654-3
eBook Packages: Springer Book Archive