General algorithms for permutations in equational inference
From MaRDI portal
Publication:5931113
DOI10.1023/A:1006439522342zbMath0985.68026OpenAlexW1690616301MaRDI QIDQ5931113
David Alan Plaisted, Jürgen Avenhaus
Publication date: 21 May 2002
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1006439522342
Symbolic computation and algebraic computation (68W30) Mechanization of proofs and logical operations (03B35) Grammars and rewriting systems (68Q42)
Related Items (2)
On leaf permutative theories and occurrence permutation groups ⋮ On the complexity of deduction modulo leaf permutative equations
This page was built for publication: General algorithms for permutations in equational inference