An algebraic approach to unification under associativity and commutativity

DOI10.1016/S0747-7171(87)80001-9zbMath0638.68106MaRDI QIDQ1099654

Albrecht Fortenbacher

Publication date: 1987

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

zbMATH Keywords

free algebraunification algorithmsabelian monoid

Mathematics Subject Classification ID

Commutative semigroups (20M14) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items

Efficient solution of linear diophantine equations, Permutative rewriting and unification, AC Completion with Termination Tools, On pot, pans and pudding or how to discover generalised critical Pairs, Unification in permutative equational theories is undecidable

Cites Work

• Unnamed Item
• Unnamed Item
• Non-negative integer basis algorithms for linear equations with integer coefficients
• Unification in abelian semigroups
• An algorithm to generate the basis of solutions to homogeneous linear Diophantine equations
• A Unification Algorithm for Associative-Commutative Functions
• A Machine-Oriented Logic Based on the Resolution Principle