Skip to main content
Log in

A technical note on AC-Unification. The number of minimal unifiers of the equation αx1 + ⋯ + αxpAC βy1 + ⋯ + βyq

  • Published:
Journal of Automated Reasoning Aims and scope Submit manuscript

Abstract

We show in this note that the equation αx1 + #x22EF; +αxpACβy1 + α +βyq where + is an AC operator and αx stands for x+...+x (α times), has exactly

$$\left( { - 1} \right)^{p + q} \sum\limits_{i = 0}^p {\sum\limits_{j = 0}^q {\left( { - 1} \right)^{1 + 1} \left( {\begin{array}{*{20}c} p \\ i \\ \end{array} } \right)\left( {\begin{array}{*{20}c} q \\ j \\ \end{array} } \right)} 2^{\left( {\alpha + \begin{array}{*{20}c} {j - 1} \\ \alpha \\ \end{array} } \right)\left( {\beta + \begin{array}{*{20}c} {i - 1} \\ \beta \\ \end{array} } \right)} } $$

minimal unifiers if gcd(α, β)=1.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. H-J. Bürckert, A. Herold, D. Kapur, J. Siekmann, M. Stickel, M. Tepp, and H. Zhang, ‘Opening the AC-unification race.’ J. Automated Reasoning, 4(1), 465–474 (1988).

    Google Scholar 

  2. H-J. Bürckert, A. Herold, and M. Schmidt-Schauß, ‘On equational theories, unification and decidability.’ In P. Lescanne (ed). Proceedings of the Second Conference on Rewriting Techniques and Applications, Bordeaux (France), Springer-Verlag, May 1987.

    Google Scholar 

  3. D. H. Greene and D. E. Knuth, Mathematics for the Analysis of Algorithms. Volume 1 of Progress in Computer Science, Birkhäuser, 1981.

  4. A. Herold and J. Siekmann, ‘Unification in Abelian Semigroups,’ J. Automated Reasoning, 3, 247–283 (1987).

    Google Scholar 

  5. D. Kapur and P. Narendran, ‘NP-Completeness of the set unification and matching problems,’ In J. Siekmann (ed), Proceedings 8th Conference on Automated Deduction, Springer-Verlag, 1986.

  6. J-L. Lambert, ‘Une borne pour les générateurs des solutions entières positives d'une équation diophantienne linéaire.’ Technical Report 334, Université de Paris-Sud, Centre d'Orsay, février 1987.

  7. J. Siekmann and P. Szabo, ‘Universal unification.’ in R. Shostak (ed), Proceedings 7th International Conference on Automated Deductions, 1–42, Springer-Verlag, Napa Valley (California, USA), 1984.

    Google Scholar 

  8. M. E. Stickel, ‘A complete unification algorithm for associative-commutative functions,’ Proceedings 4th International Joint Conference on Artificial Intelligence, Tbilisi, 1975.

  9. P. Szabo, Unifikationstheorie erster Ordnung. Ph.D. thesis, Universität Karlsruhe, 1982.

Download references

Author information

Authors and Affiliations

Authors

Additional information

This work was partly supported by the GRECO de programmation.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Domenjoud, E. A technical note on AC-Unification. The number of minimal unifiers of the equation αx1 + ⋯ + αxpAC βy1 + ⋯ + βyq . J Autom Reasoning 8, 39–44 (1992). https://doi.org/10.1007/BF00263448

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00263448

Key words

Navigation