Abstract Congruence Closure - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Journal of Automated Reasoning Year : 2003

Abstract Congruence Closure

Leo Bachmair
  • Function : Author
Ashish Tiwari
  • Function : Author


We describe the concept of an abstract congruence closure and provide equational inference rules for its construction. The length of any maximal derivation using these inference rules for constructing an abstract congruence closure is at most quadratic in the input size. The framework is used to describe the logical aspects of some well-known algorithms for congruence closure. It is also used to obtain an efficient implementation of congruence closure. We present experimental results that illustrate the relative differences in performance of the different algorithms. The notion is extended to handle associative and commutative function symbols, thus providing the concept of an associative-commutative congruence closure. Congruence closure (modulo associativity and commutativity) can be used to construct ground convergent rewrite systems corresponding to a set of ground equations (containing AC symbols).
No file

Dates and versions

inria-00099511 , version 1 (26-09-2006)


  • HAL Id : inria-00099511 , version 1


Leo Bachmair, Ashish Tiwari, Laurent Vigneron. Abstract Congruence Closure. Journal of Automated Reasoning, 2003, 31 (2), pp.129-168. ⟨inria-00099511⟩
92 View
0 Download


Gmail Facebook X LinkedIn More