Completion for rewriting modulo a congruence

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


We present completion methods for rewriting modulo a congruence, generalizing previous methods by Peterson and Stickel (1981) and Jouannaud and Kirchner (1986). We formalize our methods as equational inference systems and describe techniques for reasoning about such systems.


  1. [1]
    Bachmair, L. (1987). Proof methods for equational theories. Ph.D. thesis, Dept. of Computer Science, Univ. of Illinois at Urbana-Champaign.Google Scholar
  2. [2]
    Bachmair, L., and Dershowitz, N. (1986). Critical pair criteria for the Knuth-Bendix completion method. Proc. Symp. on Symbolic and Algebraic Computation, B. W. Char, ed., Waterloo, Canada, 215–217. (Revised version to appear in J. Symbolic Computation.)Google Scholar
  3. [3]
    Bachmair, L., Dershowitz, N., and Hsiang, J. (1986). Orderings for equational proofs. Proc. IEEE Symp. Logic in Computer Science, Cambridge, Massachusetts, 346–357.Google Scholar
  4. [4]
    Hullot, J.-M. (1980). A catalogue of canonical term rewriting systems. Tech. Rep. CSL-113, SRI International, Menlo Park, California.Google Scholar
  5. [5]
    Jouannaud, J.-P. (1983). Confluent and coherent equational term rewriting systems: Application to proofs in abstract data types. Proc. 8th Coll. on Trees in Algebra and Programming, G. Ausiello and M. Protasi, eds., Lect. Notes in Comp. Sci., vol. 59, Springer-Verlag, Berlin, 269–283.Google Scholar
  6. [6]
    Jouannaud, J.-P., and Kirchner, H. (1986). Completion of a set of rules modulo a set of equations. SIAM J. Computing 15, 1155–1194.Google Scholar
  7. [7]
    Kapur, D., Musser, D.R., and Narendran, P. (1986). Only prime superpositions need be considered in the Knuth-Bendix procedure. Unpublished manuscript, Computer Science Branch, Corporate Research and Development, General Electric, Schenectady, New York.Google Scholar
  8. [8]
    Knuth, D., and Bendix, P. (1970). Simple word problems in universal algebras. Computational Problems in Abstract Algebra, J. Leech, ed., Pergamon Press, 263–297.Google Scholar
  9. [9]
    Küchlin, W. (1986). Equational Completion by Proof Simplification. Report No. 86-02, Mathematik, ETH Zürich, Switzerland.Google Scholar
  10. [10]
    Lankford, D., and Ballantyne, A. (1977). Decision procedures for simple equational theories with permutative axioms: Canonical sets of permutative reductions. Memo ATP-37, Dept. of Mathematics and Computer Science, University of Texas, Austin, Texas.Google Scholar
  11. [11]
    Peterson, G., and Stickel, M. (1981). Complete sets of reductions for some equational theories. J. ACM 28, 233–264.Google Scholar
  12. [12]
    Siekman, J. (1984). Universal unification. Proc. 7th Conf. Automated Deduction, R. E. Shostak, ed., Lect. Notes in Comp. Sci., vol. 170, Springer-Verlag, Berlin, 1–42.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

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 Illinois at Urbana-ChampaignUrbanaUSA

Personalised recommendations