Abstract
A method for E-unification in arbitrary equational theories E is presented which directly generalizes the standard technique of Narrowing. The method is defined in terms of transformations on systems, building upon and refining results of Gallier and Snyder.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
L. Bachmair Proof Methods for Equational Theories. Dissertation, University of Illinois, Urbana Champaign, 1987.
L. Bachmair, N. Dershowitz, and J.Hsiang. Orderings for Equational Proofs. In Proc. Symp. Logic in Computer Science, pp. 346–357, 1986.
L. Bachmair, N. Dershowitz and D. Plaisted. Completion without Failure. In Proceedings of CREAS, May 1987.
M. Fay. First-order Unification in an Equational Theory. In Proceedings of the Fourth Workshop on Automated Deduction, Austin, Texas 1979.
J. H. Gallier and W. Snyder. Complete Sets of Transformations for General E-Unification. In TCS 67:2,3, pp. 203–260, 1989. Also presented at RTA, 1987.
J. Herbrand. Sur la Theorie de la Demonstration (Dissertation, 1930). In Logical Writings, W. Goldfarb, ed., Cambridge, 1971.
G. Huet and D. C. Oppen. Equations and Rewrite Rules: A Survey. In Formal Languages: Perspectives and Open Problems, R. V. Book, ed., Academic Press, NY, 1982.
J-M. Hullot. Canonical Forms and Unification. In Proceedings of the Fifth International Conference on Automated Deduction 1980.
C. Kirchner. A New Equational Unification Method: A Generalization of Martelli-Montanari's Algorithm. In Proceedings of the Seventh International Conference on Automated Deduction, 1984.
C. Kirchner. Méthodes et Outils de Conception Systematique d'Algorithmes d'Unification dans les Theories Equationnelles. Thèse d'Etat, Université de Nancy I, 1985.
C. Kirchner. Computing Unification Algorithms. Presented at LICS, 1986.
A. Martelli and U. Montanari. An Efficient Unificaton Algorithm. In ACM Transactions on Programming Languages and Systems 4:2, pp. 258–282, 1982.
A. Martelli, C. Moiso, and G. F. Rossi. An Algorithm for Unification in Equational Theories. Presented at the Third Conference on Logic Programming, 1986.
G. Plotkin. Building in Equational Theories. In Machine Intelligence 7, pp. 73–90, 1972.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dougherty, D.J., Johann, P. (1990). An improved general E-unification method. In: Stickel, M.E. (eds) 10th International Conference on Automated Deduction. CADE 1990. Lecture Notes in Computer Science, vol 449. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52885-7_93
Download citation
DOI: https://doi.org/10.1007/3-540-52885-7_93
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52885-2
Online ISBN: 978-3-540-47171-4
eBook Packages: Springer Book Archive