Abstract
We describe our implementation of the unification algorithm for terms involving some associative-commutative operators plus free function symbols described by Boudetet al. The first goal of this implementation is efficiency, more precisely competing for theAC Unification Race. Although our implementation has been designed for good performance when applied to non-elementaryAC-unification problems, it is also very efficient on elementary problems. Our implementation, written in C and running on Sun workstations, is to be compared with the implementations in LISP, on Symbolics LIPS machines.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Adi, M. and Kirchner, C., ‘Associative-commutative unification: The system solving approach’, in Alfonso Miola (Ed.),Proc. DISCO'90. LNCS 429, Capri, Italy, April 1990. Springer-Verlag.
Birkhoff, G., ‘On the structure of abstract algebras’,Proc. Cambridge Phil. Society,31 (1935).
Boudet, A.,Unification dans les mélanges de théories equationnelles. Ph.D. thesis, Université de Paris-Sud, Orsay (February 1990).
Boudet, A., 'Unification in combinations of equational theories: An efficient algorithm, inProc. 10th Int. Conf. on Automated Deduction, Kaiserslautern. Springer-Verlag, July 1990.
Boudet, A., Contejean, E. and Devie, H., ‘A newAC unification algorithm with a new algorithm for solving diophantine equations’, inProc. 5th IEEE Symp. Logic in Computer Science, Philadelphia, June 1990.
Bürckert, H.-J., ‘Matching, a special case of unification?’J. Symbolic Computation,8, 523–536 (1989).
Bürckert, H.-J., Hérold, A., Kapur, D., Siekmann, J. H., Stickel, M. E., Tepp, M. and Zhang, H., ‘Opening theAC-unification race’,J. Automated Reasoning,4(4), 465–474 (1988).
Christian, J. and Lincoln, P., ‘Adventures in associative-commutative unification (a summary)’, inProc. 9th Conf. on Automated Deduction, Argonne,LNCS 310. Springer-Verlag (May 1988).
Clausen, M. and Fortenbacher, A., ‘Efficient solution of linear Diophantine equations’, Research Report 32/87, Univ. Karlsruhe, November 1987.
Comon, H.,Unification et disunification: Théorie et applications, Thèse de Doctorat, I.N.P. de Grenoble, France (1988).
Contejean, E. and Devie, H., ‘Résolution de systèmes linéaires d'équations Diophantiennes’,Comptes Rendus de l'Académie des Sciences,313(1), 115–120 (1991).
Corbin, J. and Bidoit, M., ‘A rehabilitation of Robinson's unification algorithm’,Information Processing Letters 1983.
Dershowitz, N. and Jouannaud, J.-P.Rewrite systems, in J. van Leeuwen (ed),Handbook of Theoretical Computer Science, Vol. B, North-Holland (1990).
Fages, F., ‘Associative-commutative unification’,J. Symbolic Computation,3(3) (1987).
Fortenbacher, A., ‘An algebraic approach to unification under associativity and commutativity’, inProc. Rewriting Techniques and Applications 85, Dijon,LNCS 202. Springer-Verlag, May 1985.
Guckenbiehl, Th. and Hérold, A., ‘Solving linear Diophantine equations’, Technical Report 85-IV-KL, SEKI, University of Kaiserslautern, Germany, 1985.
Herold, A.,Combination of unification algorithms in equational theories. Ph.D. thesis, Universität Kaiserslautern, Kaiserslautern, Germany, 1987.
Huet, G., ‘An algorithm to generate the basis of solutions to homogeneous linear diophantine equations’,Information Processing Letters,7(3), April 1978.
Hullot, J.-M., ‘Associative commutative pattern matching’, inProc. 6th IJCAI (Vol. I), Tokyo, pp. 406–412, August 1979.
Jouannaud, J.-P. and Kirchner, C., in J.-L. Lassez and G. Plotkin (eds),Alan Robinson's Anniversary Book, ‘Solving Equations in Abstract algebras: A rule-based survey’, MIT Press, 1990 (to appear).
Kapur, D. and Zhang, H., ‘Rll: A rewrite rule laboratory’, inProc. 9th Conf. on Automated Deduction, Argonne,LNCS 310, pp. 768–769. Springer-Verlag, 1988.
Kirchner, C.,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.
Lambert, J. L., ‘Une borne pour les générateurs des solutions entières positives d'une équation Diophantienne linéaire’,Comptes Rendus de l'Académie des Sciences de Paris,305 (1987). Série I.
Lankford, D., ‘New non-negative integer basis algorithms for linear equations with integer coefficients’, Unpublished manuscript, 1987.
Livesey, M. and Siekmann, J., ‘Unification of bags and sets’, Research report, Institut fur Informatik I, Univ. Karlsruhe, West Germany, 1976.
Martelli, A. and Montanari, U., ‘An efficient unification algorithm’,ACM Transactions on Programming Languages and Systems,4(2), 258–282 (1982).
Plotkin, G., ‘Building in equational theories’, inMarchine Intelligence 7, Edinburgh Univ. Press, 1972.
Robinson, J. A., ‘A machine-oriented logic based on the resolution principle’,J. ACM,12(1), 23–41 (1965).
Schmidt-Schauß, M., ‘Unification in a combination of arbitrary disjoint equational theories’, inProc. 9th Conf. on Automated Deduction, Argonne,LNCS 310, Springer-Verlag, May 1988.
Stickel, M., ‘A unification algorithm for associative-commutative functions’,J. ACM,28(3), 423–434 (1981).
Vuillemin, J., ‘A data structure for manipulating priority queues’,J. ACM,21(4) (1978).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Boudet, A. Competing for theAC-Unification Race. J Autom Reasoning 11, 185–212 (1993). https://doi.org/10.1007/BF00881905
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00881905