General Algorithms for Permutations in Equational Inference
David A. Plaisted, Jürgen Avenhaus · Carolina Digital Repository (University of North Carolina at Chapel Hill) · 2021
We study some general algorithms for processing permutations and permutation groups and consider their application to equational reasoning and term-rewriting systems. We also present some complexity results for particular equational consequence problems related to permutations.