General Algorithms for Permutations in Equational Inference

@article{Avenhaus2001GeneralAF,
  title={General Algorithms for Permutations in Equational Inference},
  author={J{\"u}rgen Avenhaus and David A. Plaisted},
  journal={Journal of Automated Reasoning},
  year={2001},
  volume={26},
  pages={223-268}
}
Mechanized systems for equational inference often produce many terms that are permutations of one another. We propose to gain efficiency by dealing with such sets of terms in a uniform manner, by the use of efficient general algorithms on permutation groups. We show how permutation groups arise naturally in equational inference problems, and study some of their properties. We also study some general algorithms for processing permutations and permutation groups, and consider their application to… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…