Permutative rewriting and unification

DOI10.1016/j.ic.2006.11.001zbMath1112.68072OpenAlexW1967953866MaRDI QIDQ876048

Thierry Boy de la Tour, Mnacho Echenim

Publication date: 16 April 2007

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2006.11.001

zbMATH Keywords

permutation groupsterm rewritingequational theories\(E\)-unification

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items

On First-Order Model-Based Reasoning

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Associative-commutative unification
• An algebraic approach to unification under associativity and commutativity
• Group-theoretic algorithms and graph isomorphism
• Fundamental algorithms for permutation groups
• Decidability and complexity analysis by basic paramodulation
• Single versus simultaneous equational unification and equational unification for variable-permuting theories
• Unification in permutative equational theories is undecidable
• Unification in commutative theories, Hilbert's basis theorem, and Gröbner bases
• A Unification Algorithm for Associative-Commutative Functions
• Automated Reasoning
• Term Rewriting and Applications