Abstract
We show that deciding unification modulo both-sided distributivity of a symbol * over a symbol + can be reduced to AC1-unification for all unification problems which do not involve the + operator. Moreover, we can describe “almost all” solutions in a finite way, although there are in general infinitely many minimal solutions for such problems. As a consequence, *-problems appear as a good candidate for a notion of solved-form for D-unification.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Evelyne Contejean. éléments pour la décidabilité de l'unification modulo la distributivité. Thèse de Doctorat, Université de Paris-Sud, France, Avril 1992.
Nachum Dershowitz and Jean-Pierre Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 243–309. North-Holland, 1990.
J. Herbrand. Recherches sur la théorie de la démonstration. Thèse d'Etat, Univ. Paris, 1930. Also in: Ecrits logiques de Jacques Herbrand, PUF, Paris, 1968.
Alexander Herold and Jorg H. Siekmann. Unification in abelian semi-groups. Journal of Automated Reasoning, 3(3):247–283, 1987.
Claude Kirchner. Méthodes et outils de conception systématique d'algorithmes d'unification dans les théories equationnelles. Thèse d'Etat, Univ. Nancy, France, 1985.
Claude Kirchner and Francis Klay. Syntactic theories and unification. In Proc. 5th IEEE Symp. Logic in Computer Science, Philadelphia, June 1990.
Donald E. Knuth and Peter B. Bendix. Simple word problems in universal algebras. In J. Leech, editor, Computational Problems in Abstract Algebra, pages 263–297. Pergamon Press, 1970.
G.S. Makanin. The problem of solvability of equations in a free semigroup. Akad. Nauk. SSSR, 233(2), 1977.
J. V. Matijasevic. Enumerable sets are diophantine. Soviet Mathematics (Dokladi), 11(2):354–357, 1970.
J. A. Robinson. A machine-oriented logic based on the resolution principle. Journal of the ACM, 12(1):23–41, 1965.
P. Szabo. Unifikationstheorie erster Ordnung. Technical Report Thesis, Fakultat fur Informatik, University Karlsruhe, Karlsruhe, West Germany, 1982.
Erik Tiden and Stefan Arnborg. Unification problems with one-sided distributivity. Journal of Symbolic Computation, (3):183–202, 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Contejean, E. (1993). A partial solution for D-unification based on a reduction to AC 1-unification. In: Lingas, A., Karlsson, R., Carlsson, S. (eds) Automata, Languages and Programming. ICALP 1993. Lecture Notes in Computer Science, vol 700. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56939-1_107
Download citation
DOI: https://doi.org/10.1007/3-540-56939-1_107
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56939-8
Online ISBN: 978-3-540-47826-3
eBook Packages: Springer Book Archive