Abstract Congruence Closure and Specializations

  • Leo Bachmair
  • Ashish Tiwari
Conference paper

DOI: 10.1007/10721959_5

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1831)
Cite this paper as:
Bachmair L., Tiwari A. (2000) Abstract Congruence Closure and Specializations. In: McAllester D. (eds) Automated Deduction - CADE-17. CADE 2000. Lecture Notes in Computer Science, vol 1831. Springer, Berlin, Heidelberg

Abstract

We use the uniform framework of abstract congruence closure to study the congruence closure algorithms described by Nelson and Oppen [9], Downey, Sethi and Tarjan [7], and Shostak [11]. The descriptions thus obtained abstract from certain implementation details while still allowing for comparison between these different algorithms. Experimental results are presented to illustrate the relative efficiency and explain differences in performance of these three algorithms. The transition rules for computation of abstract congruence closure are obtained from rules for standard completion enhanced with an extension rule that enlarges a given signature by new constants.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Leo Bachmair
    • 1
  • Ashish Tiwari
    • 1
  1. 1.Department of Computer ScienceState University of New YorkStony BrookU.S.A

Personalised recommendations