datacardagum Unification and Matching in an Abelian Group Category: Algebra Hackage About agumThe unification problem is given the problem statement t =? t\', find a most general substitution s such that s(t) = s(t\') modulo the axioms of an Abelian group. The matching problem is to find a most general substitution s such that s(t) = t\' modulo the axioms. Substitition s is more general than s\' if there is a substitition s\" such that s\' = s\" o s.Maintainerramsdell@mitre.orgLicenseGPLDependenciesbase, containersModulesAlgebra.AbelianGroup.UnificationMatching Algebra.AbelianGroup.IntLinEqExecutablesagumLatest Version2.4Older Versions1.0, 2.0, 2.1, 2.2, 2.3, 2.4