scientific article; zbMATH DE number 3885353
From MaRDI portal
Publication:3219154
[For the entire collection see Zbl 0545.00023.] We describe a method of constructing Abelian group unification algorithms for elementary terms which uses any basis algorithms for the integer solutions of linear equations with integer coefficients. We illustrate the method with computer generated examples using two different algorithms.
Recommendations
Cited in
(16)- Associative-commutative unification
- Unification in combinations of collapse-free regular theories
- Unification problem in equational theories
- Semi-unification of two terms in Abelian groups
- Unification in commutative semigroups
- Complete sets of unifiers and matchers in equational theories
- Intersection of term equality sets in finitely defined algebras
- Identity problems, solvability of equations and unification in varieties of semigroups related to varieties of groups
- Efficient general AGH-unification
- Unification properties of commutative theories: a categorical treatment
- Efficient general unification for XOR with homomorphism
- Unification in commutative theories
- Unification in Boolean rings and Abelian groups
- Unification in a combination of arbitrary disjoint equational theories
- Unification in a combination of equational theories: an efficient algorithm
- Unification in monoidal theories
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3219154)