A critical pair criterion for completion modulo a congruence

  • Leo Bachmair
  • Nachum Dershowitz
Advanced Algorithms
Part of the Lecture Notes in Computer Science book series (LNCS, volume 378)


  1. [1]
    L. Bachmair and N. Dershowitz. Completion for rewriting modulo a congruence. To appear in Theor. Comput. Sci. (1988).Google Scholar
  2. [2]
    L. Bachmair and N. Dershowitz. Critical pair criteria for completion. J. Sym. Comput. (1988) 6:1–18.Google Scholar
  3. [3]
    J.-P. Jouannaud and H. Kirchner. Completion of a set of rules modulo a set of equations. SIAM J. Comput. (1986) 15:1155–1194.CrossRefGoogle Scholar
  4. [4]
    D. Kapur, D.R. Musser, and P. Narendran. Only prime superpositions need be considered in the Knuth-Bendix completion procedure. J. Sym. Comput. (1988) 6:19–36.Google Scholar
  5. [5]
    D. Knuth and P. Bendix. Simple word problems in universal algebras. In Computational Problems in Abstract Algebra, ed. J. Leech, Pergamon Press, Oxford, 1970, pp. 263–297.Google Scholar
  6. [6]
    G. Peterson and M. Stickel. Complete sets of reductions for some equational theories. J. ACM (1981) 28:233–264.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Leo Bachmair
    • 1
  • Nachum Dershowitz
    • 2
  1. 1.Department of Computer ScienceSUNY at Stony BrookStony BrookUSA
  2. 2.Department of Computer ScienceUniversity of IllinoisUrbanaUSA

Personalised recommendations