Abstract
This paper presents an algorithm and an implementation in C language of the Associative-Commutative unification based on solving systems of equations. Benchmarks are proposed for evaluating the performances of this algorithm and its implementation.
This work has been partly supported by the GRECO de programmation of CNRS (France)
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M. Adi and C. Kirchner. AC-Unification Race: the System Solving Approach, Implementation and Benchmarks. Research Report 89-R-169, CRIN, Nancy (France), 1989.
A. Boudet. A new Combination Technique for AC Unification. Internal Report 494, LRI, Orsay (France), June 1989.
H-J. Bürckert, A. Herold, D. Kapur, J. Siekmann, M. Stickel, M. Tepp, and H. Zhang. Opening the AC-unification race. Journal of Automated Reasoning, 4(1):465–474, 1988.
H-J. Bürckert, A. Herold, and M. Schmidt-Schauß. On equational theories, unification and decidability. Journal of Symbolic Computation, 8(1 & 2):3–50, 1989. Special issue on unification. Part two.
M Clausen and A. Fortenbacher. Efficient solution of linear diophantine equations. Journal of Symbolic Computation, 8(1 & 2):201–216, 1989. Special issue on unification. Part two.
E. Domenjoud. AC unification through order-sorted AC1 unification. In H-J. Bürckert and W. Nutt, editors, Proceedings of UNIF'89, third international workshop on unification, Lambrecht (FR Germany), June 1989. Also in CRIN Research Report 89-R-67.
E. Domenjoud. Number of Minimal Unifiers of the Equation αx 1 + ... + αx p =AC βy1 + ... + βyq. Research Report 89-R-2, CRIN, Nancy (France), 1989. To appear in the Journal of Automated Reasoning (1990).
H. Devie E. Contejean. Solving systems of linear diophantine equations. In H-J. Bürckert and W. Nutt, editors, Proceedings of UNIF'89, third international workshop on unification, Lambrecht (FR Germany), June 1989.
F. Fages and G. Huet. Complete sets of unifiers and matchers in equational theories. Theoretical Computer Science, 43(1):189–200, 1986.
A Fortenbacher. Algebraische unifikation. 1983. Diplomarbeit, Institut für Informatik, Universität Karlsruhe.
A. Herold. Combination of Unification Algorithms in Equational Theories. PhD thesis, Universität Kaiserslautern, 1987.
G. Huet. An algorithm to generate the basis of solutions to homogenous linear diophantine equations. Information Processing Letters, 7(3):144–147, 1978.
J-M. Hullot. Compilation de formes canoniques dans les théories équationelles. Thèse de 3ième cycle, Université de Paris Sud, Orsay, France, 1980.
D. Kapur and P. Narendran. NP-completeness of the set unification and matching problems. In J. Siekmann, editor, Proceedings 8th Conference on Automated Deduction, Springer-Verlag, 1986.
C. Kirchner. From unification in combination of equational theories to a new AC-unification algorithm. In H. Aït-Kaci and M. Nivat, editors, Resolution of Equations in Algebraic Structures, pages 171–210, Academic Press, New-York, 1989.
C. Kirchner. Méthodes et outils de conception systématique d'algorithmes d'unification dans les théories équationnelles. Thèse d'état de l'Université de Nancy I, 1985.
C. Kirchner. Methods and tools for equational unification. In Proceedings of the Colloquium on Resolution of Equations in Algebraic Structures, Austin (Texas), May 1987.
J.-L. Lambert. Une borne pour les générateurs des solutions entières positives d'une équation diophantienne linéaire. Compte-rendu de L'Académie des Sciences de Paris, 305(1):39–40, 1987.
D. Lankford. Non-negative integer basis algorithms for linear equations with integer coefficients. Technical Report, Louisiana Tech University, Ruston, LA 71272, 1987.
P. Lincoln and J. Christian. Adventures in associative-commutative unification. Journal of Symbolic Computation, 8(1 & 2):217–240, 1989. Special issue on unification. Part two.
M. Livesey and J. Siekmann. Unification of Bags and Sets. Technical Report, Institut fur Informatik I, Universität Karlsruhe, 1976.
G. Peterson and M. Stickel. Complete sets of reductions for some equational theories. Journal of the Association for Computing Machinery, 28:233–264, 1981.
J.-F. Romeuf. A polynomial algorithm for solving systems of two linear diophantine equations. Technical Report, Laboratoire d'Informatique de Rouen (France) and LITP, 1989.
M. Schmidt-Schauss. Combination of unification algorithms. Journal of Symbolic Computation, 8(1 & 2):51–100, 1989. Special issue on unification. Part two.
M.E. Stickel. A unification algorithm for associative-commutative functions. Journal of the Association for Computing Machinery, 28:423–434, 1981.
M.E. Stickel. Unification Algorithms for Artificial Intelligence Languages. PhD thesis, Carnegie-mellon University, 1976.
K. Yelick. Combining unification algorithm for confined equational theories. In J.-P. Jouannaud, editor, Proceedings of the 1st Conference on Rewriting Techniques and Applications, pages 301–324, Springer-Verlag, Dijon (France), May 1985.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Adi, M., Kirchner, C. (1990). AC-unification race: The system solving approach and its implementation. In: Miola, A. (eds) Design and Implementation of Symbolic Computation Systems. DISCO 1990. Lecture Notes in Computer Science, vol 429. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52531-9_137
Download citation
DOI: https://doi.org/10.1007/3-540-52531-9_137
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52531-8
Online ISBN: 978-3-540-47014-4
eBook Packages: Springer Book Archive