General Algorithms for Permutations in Equational Inference

  • Authors:

  • Jürgen Avenhaus;David A. Plaisted

  • Affiliations:

  • Universität Kaiserslautern, Fachbereich Informatik, D-67663 Kaiserslautern, Germany. e-mail: avenhaus@informatik.uni-kl.de;Department of Computer Science, University of North Carolina at Chapel Hill, Chapel Hill, NC 27599-3175, U.S.A. e-mail: plaisted@cs.unc.edu

  • Venue:
  • Journal of Automated Reasoning
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 equational reasoning and term-rewriting systems. Finally, we show how these techniques can be incorproated into resolution theorem-proving strategies.