Permutative rewriting and unification
From MaRDI portal
Publication:876048
DOI10.1016/J.IC.2006.11.001zbMATH Open1112.68072OpenAlexW1967953866MaRDI QIDQ876048FDOQ876048
Authors: 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
Recommendations
- Term Rewriting and Applications
- Unification and Matching Modulo Leaf-Permutative Equational Presentations
- Unification in permutative equational theories is undecidable
- Some results on equational unification
- Single versus simultaneous equational unification and equational unification for variable-permuting theories
Cites Work
- Title not available (Why is that?)
- Unification theory
- Title not available (Why is that?)
- Group-theoretic algorithms and graph isomorphism
- A Unification Algorithm for Associative-Commutative Functions
- Single versus simultaneous equational unification and equational unification for variable-permuting theories
- Unification in commutative theories, Hilbert's basis theorem, and Gröbner bases
- Fundamental algorithms for permutation groups
- Automated Reasoning
- Associative-commutative unification
- Decidability and complexity analysis by basic paramodulation
- An algebraic approach to unification under associativity and commutativity
- Title not available (Why is that?)
- Unification in permutative equational theories is undecidable
- Term Rewriting and Applications
Cited In (7)
This page was built for publication: Permutative rewriting and unification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q876048)
