Congruence Closure Modulo Permutation Equations

  title={Congruence Closure Modulo Permutation Equations},
  author={Dohan Kim and Christopher Lynch},
We present a framework for constructing congruence closure modulo permutation equations, which extends the abstract congruence closure [7] framework for handling permutation function symbols. Our framework also handles certain interpreted function symbols satisfying each of the following properties: idempotency (I), nilpotency (N), unit (U), I∪U , or N∪U . Moreover, it yields convergent rewrite systems corresponding to ground equations containing permutation function symbols. We show that… 

Figures from this paper



An RPO-Based Ordering Modulo Permutation Equations and Its Applications to Rewrite Systems

A new RPO-based ordering modulo E using (permutation) group actions and their associated orbits is presented, which is an E-compatible reduction ordering on terms with the subterm property and is E-total on ground terms.

Abstract Congruence Closure

The concept of an abstract congruence closure is described and equational inference rules for its construction are provided, extended to handle associative and commutative function symbols, thus providing an associative-commutative congruences closure.

A Modular Associative Commutative (AC) Congruence Closure Algorithm

  • D. Kapur
  • Computer Science, Mathematics
  • 2021
The proposed algorithms neither rely on complex AC compatible well-founded orderings on nonvariable terms nor need to use the associative-commutative unification and extension rules in completion for generating canonical rewrite systems for congruence closures.

Conditional Congruence Closure over Uninterpreted and Interpreted Symbols

  • D. Kapur
  • Computer Science
    J. Syst. Sci. Complex.
  • 2019
Interesting outcomes include algorithms for canonical rewrite systems for ground equational and conditional theories on uninterpreted and interpreted symbols leading to generation of canonical forms for ground terms, constrained terms and Horn equations.

Efficient Algorithms for Computing Modulo Permutation Theories

This paper presents a polynomial time algorithm for testing E-equality for a fixed set E, where E consists of permutation equations only and testing matchability and unifiability is NP-complete.

Shostak's Congruence Closure as Completion

Shostak's congruence closure algorithm is demystified, using the framework of ground completion on (possibly nonterminating, non-reduced) rewrite rules. In particular, the canonical rewriting

Fast Decision Procedures Based on Congruence Closure

A simple proof is given that the congruence closure algorithm provides a decision procedure for the quantifier-free theory of equality and the problem of determining the satisfiability of a conjunction of literals becomes NP-complete if the axiomatization of the theory of list structure is changed slightly.

General Algorithms for Permutations in Equational Inference

This work proposes to gain efficiency by dealing with sets of terms in a uniform manner, by the use of efficient general algorithms on permutation groups by studying some general algorithms for processing permutations and permutations groups.

Complexity of finitely presented algebras

The schema satisfiability problem and schema validity problem are shown to be ≤m m log-complete for NP and co-NP, respectively, and the problem of isomorphism of finitely presented algebras is shown to to be polynomial time many-one equivalent to the issue of graph isomorphicism.

Programming up to Congruence

The design of Zombie is presented, a dependently-typed programming language that uses an adaptation of a congruence closure algorithm for proof and type inference that allows the type checker to automatically use equality assumptions from the context when reasoning about equality.