Only prime superpositions need be considered in the Knuth-Bendix completion procedure

  • Authors:

  • Deepak Kapur;David R. Musser;Paliath Narendran

  • Affiliations:

  • Computer Science Branch Corporate Research and Development General Electric Company Schenectady, NY 12345, USA;Computer Science Branch Corporate Research and Development General Electric Company Schenectady, NY 12345, USA;Computer Science Branch Corporate Research and Development General Electric Company Schenectady, NY 12345, USA

  • Venue:
  • Journal of Symbolic Computation
  • Year:
  • 1988

Quantified Score

Hi-index 0.00

Visualization

Abstract

The Knuth and Bendix test for local confluence of a term rewriting system involves generating superpositions of the left-hand sides, and for each superposition deriving a critical pair of terms and checking whether these terms reduce to the same term. We prove that certain superpositions, which are called composite because they can be split into other superpositions, do not have to be subjected to the critical-pair-joinability test; it suffices to consider only prime superpositions. As a corollary, this result settles a conjecture of Lankford that unblocked superpositions can be omitted. To prove the result, we introduce new concepts and proof techniques which appear useful for other proofs relating to the Church-Rosser property. This test has been implemented in the completion procedures for ordinary term rewriting systems as well as term rewriting systems with associative-commutative operators. Performance of the completion procedures with this test and without the test are compared on a number of examples in the Rewrite Rule Laboratory (RRL) being developed at General Electric Research and Development Center.