Abstract
We study matching problems for one-sided distributivity. A general method is presented to build up a matching algorithm in an equational theory, and illustrated by the case of one-sided distributivity. Using this algorithm, (right and left) distributivity matching is shown decidable and a method to compute distributive matches is given.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
10. References
S. Arnborg and E. Tiden, “Unification problems with one-sided distributivity”, in Proc. 1st Conf. on Rewriting Techniques and Applications, vol. 202, Springer Verlag, Dijon (France), 1985, 398–406.
J. A. Bergstra and J. W. Klop, “The Algebra of Recursively defined Processes and the Algebra of Regular Processes”, in ICALP 84, vol. 172, 1984, 82–94.
N. Dershowitz, “Computing With Term Rewriting Systems”, Procedings of An NSF Workshop On The Rewrite Rule Laboratory, April 1984.
F. Fages and G. Huet, “Unification and Matching in Equational Theories”, Proceedings of CAAP 83, 159, (1983), 205–220, Springer Verlag.
K. Futatsugi, J. A. Goguen, J. P. Jouannaud and J. Meseguer, “Principles of OBJ2”, in Proceedings, 12th ACM Symposium on Principles of Programming Languages Conference, 1985.
J. Hsiang, “Two Results in Term Rewriting Theorem Proving”, in Proc. 1st Conf. on Rewriting Techniques and Applications, vol. 202, Springer Verlag, Dijon (France), 1985, 301–324.
G. Huet and D. Oppen, “Equations and Rewrite Rules: A Survey”, in Formal Languages: Perspectives And Open Problems, B. R., (ed.), Academic Press, 1980.
J. P. Jouannaud and H. Kirchner, “Completion of a set of rules modulo a set of equations”, Proceedings 11th ACM Conference of Principles of Programming Languages, Salt Lake City (Utah, USA), 1984.
D. Kapur and P. Narendran, “An Equational Approach to Theorem Proving in First-Order Predicate Calculus”, in Proc. Int. Joint Conf. on Artificial Intelligence, Los Angeles, 1985.
C. Kirchner, “Méthodes et outils de conception systématique d'algorithmes d'unification dans les théories équationnelles”, Thése de doctorat d'Etat, Université de Nancy I, 1985.
J. Mzali, “Filtrage associatif, commutatif ou idempotent”, in Proceedings of the conference Materiels et logiciels pour la 5ieme generation, AFCET, Paris (France), 1985, 243–258.
P. Szabo, “Unificationtheorie erster Ordnung”, Doktorarbeit, Universitat Karlsruhe, 1982.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mzali, J. (1986). Matching with distributivity. In: Siekmann, J.H. (eds) 8th International Conference on Automated Deduction. CADE 1986. Lecture Notes in Computer Science, vol 230. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16780-3_114
Download citation
DOI: https://doi.org/10.1007/3-540-16780-3_114
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16780-8
Online ISBN: 978-3-540-39861-5
eBook Packages: Springer Book Archive