Abstract
The rules for unification in a simple syntactic theory, using Kirchner's mutation [15, 16] do not terminate in the case of associative-commutative theories. We show that in the case of a linear equation, these rules terminate, yielding a complete set of solved forms, each variable introduced by the unifiers corresponding to a (trivial) minimal solution of the (trivial) Diophantine equation where all coefficients are 1. A non-linear problem can be first treated as a linear one, that is considering two occurrences of a same variable as two different variables. After this step, one has to solve the equations between the different values that have been obtained for the different occurrences of a same variable. We show that one can restrict the search of the solutions of these latter equations to linear substitutions. This result is based on the analysis of how the minimal solutions of a linear Diophantine equation can be built-up using the solutions of the trivial Diophantine equation associated with the linearized AC-equation. This provides a new AC-unification algorithm which does not make an explicit use of the solving of linear Diophantine equations.
This research was supported in part by the Esprit Working Group CCL.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Mohamed Adi and Claude Kirchner. AC-unification race: the system solving approach. In Proc. Int. Symposium on Design and Implementation of Symbolic Computation Systems, LNCS 429, 1990.
Alexandre Boudet. Competing for the AC-unification race. Journal of Automated Reasoning, 11:185–212, 1993.
Alexandre Boudet, Evelyne Contejean, and Hervé Devie. A new AC-unification algorithm with a new algorithm for solving diophantine equations. In Proc. 5th IEEE Symp. Logic in Computer Science, Philadelphia, June 1990.
Hans-Jurgen Bürckert, Alexander Herold, Deepak Kapur, Jorg H. Siekmann, Mark E. Stickel, Michael Tepp, and Hantao Zhang. Opening the AC-unification race. Journal of Automated Reasoning, 4(4):465–474, December 1988.
Jim Christian and Patrick Lincoln. Adventures in associative-commutative unification. Technical Report ACA-ST-275-87, MCC, AI Program Austin, Austin, October 1987.
Hubert Comon, Marianne Haberstrau, and Jean-Pierre Jouannaud. Decidable properties of shallow equational theories. In Proc. 7th IEEE Symp. Logic in Computer Science, Santa Cruz, 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.
Eric Domenjoud. AC unification through order-sorted AC1 unification. Journal of Symbolic Computation, 14(6):537–556, December 1992.
François Fages. Associative-commutative unification. Journal of Symbolic Computation, 3(3), June 1987.
A. Fortenbacher. An algebraic approach to unification under associativity and commutativity. In Proc. Rewriting Techniques and Applications 85, Dijon, LNCS 202. Springer-Verlag, May 1985.
M. Franzen and L.J. Henschen, A new approach to universal unification and its application to AC-unification. In Lusk and Overbeek eds., Proc. 9th int. Conf. on Automated Deduction. Springer-Verlag, May 1988.
Alexander Herold and Jorg H. Siekmann. Unification in abelian semi-groups. Journal of Automated Reasoning, 3(3):247–283, 1987.
Jean-Pierre Jouannaud and Claude Kirchner. Solving equations in abstract algebras: A rule-based survey of unification. In Jean-Louis Lassez and Gordon Plotkin, editors, Computational Logic: Essays in Honor of Alan Robinson. MIT-Press, 1991.
D. Kapur and P. Narendran. Double-exponential complexity of computing a complete set of ac-unifiers. In Proc. 7th IEEE Symp. Logic in Computer Science, Santa Cruz, June 1992.
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. Computing unification algorithms. In Proc. 1st IEEE Symp. Logic in Computer Science, Cambridge, Mass., pages 206–216, 1986.
Claude Kirchner and Francis Klay. Syntactic theories and unification. In Proc. 5th IEEE Symp. Logic in Computer Science, Philadelphia, June 1990.
Francis Klay. Undecidable properties of syntactic theories. In Proc. 4th Rewriting Techniques and Applications, LNCS 488, Como, Italy, 1991.
M. Livesey and Jorg H. Siekmann. Unification of bags and sets. Research report, Institut fur Informatik I, Universität Karlsruhe, West Germany, 1976.
T. Nipkow. Proof transformations for equational theories. In Proc. 5th IEEE Symp. Logic in Computer Science, Philadelphia, June 1990.
M. Stickel. A unification algorithm for associative-commutative functions. Journal of the ACM, 28(3):423–434, 1981.
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
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boudet, A., Contejean, E. (1994). “Syntactic” AC-unification. In: Jouannaud, JP. (eds) Constraints in Computational Logics. CCL 1994. Lecture Notes in Computer Science, vol 845. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0016849
Download citation
DOI: https://doi.org/10.1007/BFb0016849
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58403-2
Online ISBN: 978-3-540-48699-2
eBook Packages: Springer Book Archive