Congruence Closure modulo Associativity-Commutativity - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2000

Congruence Closure modulo Associativity-Commutativity


We introduce the notion of an associative-commutative congruence closure and show how such closures can be constructed via completion-like transition rules. This method is based on combining completion algorithms for theories over disjoint signatures to produce a convergent system over an extended signature. This approach can also be used to solve the word problem for ground AC-theories without using AC-simplification orderings. We also discuss transformation of a convergent system over an extended signature to a convergent system (modulo AC) over the original signature.
Not file

Dates and versions

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


  • HAL Id : inria-00099214 , version 1


Leo Bachmair, I. V. Ramakrishnan, Ashish Tiwari, Laurent Vigneron. Congruence Closure modulo Associativity-Commutativity. 3rd International Workshop on Frontiers of Combining Systems - FroCoS'2000, Mar 2000, Nancy, France, pp.242-256. ⟨inria-00099214⟩
94 View
0 Download


Gmail Facebook Twitter LinkedIn More