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 rewrite system over an extended signature.

We introduce the notion of an associative-commutative congruence closure and show how such closures can be constructed via completion-like transition rules.

Abstract. We introduce the notion of an associative-commutative con- gruence closure and show how such closures can be constructed via.

Abstract Congruence Closure. We describe the concept of an abstract congruence closure and provide equational inference rules for its construction. · Factor ...

Nov 8, 2021 · Algorithms for computing congruence closure of ground equations over uninterpreted symbols and interpreted symbols satisfying associativity and commutativity ( ...

Mar 14, 2023 · The framework is general, flexible, and has been extended also to develop congruence closure algorithms for the cases when associative- ...

We design rule-based satisfiability procedures modulo unions of axiomatized theories, target- ing equational axioms such as Associativity or Commutativity.

Jul 6, 2021 · Algorithms for computing congruence closure of ground equations over uninterpreted symbols and interpreted symbols satisfying associativity and ...

The notion of congruence closure modulo associative and commutative (AC) theories was discussed in [6,16], and the notion of conditional congruence closure ...