Conditional Congruence Closure over Uninterpreted and Interpreted Symbols
A framework for generating congruence closure and conditional congruence closure of ground terms over uninterpreted as well as interpreted symbols satisfying various properties is proposed. It is based on some of the key concepts from Kapur’s congruence closure algorithm (RTA97) for ground equations based on introducing new symbols for all nonconstant subterms appearing in the equation set and using ground completion on uninterpreted constants and purified equalities over interpreted symbols belonging to different theories. In the original signature, the resulting rewrite systems may be nonterminating but they still generate canonical forms. A byproduct of this framework is a constant Horn completion algorithm using which ground canonical Horn rewrite systems can be generated for conditional ground theories.
New efficient algorithms for generating congruence closure of conditional and unconditional equations on ground terms over uninterpreted symbols are presented. The complexity of the conditional congruence closure is shown to be O(n*log(n)), which is the same as for unconditional ground equations. The proposed algorithm is motivated by our attempts to generate efficient and succinct interpolants for the quantifier-free theory of equality over uninterpreted function symbols which are often a conjunction of conditional equations and need additional simplification. A completion algorithm to generate a canonical conditional rewrite system from ground conditional equations is also presented. The framework is general and flexible and is used later to develop congruence closure algorithms for cases when function symbols satisfy simple properties such as commutativity, nilpotency, idempotency and identity as well as their combinations. 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.
KeywordsCompletion congruence closure conditional congruence closure intepreted symbols rewriting uninterpreted symbols
Unable to display preview. Download preview PDF.
I would like to thank Jose Castellanos Joo for comments and implementing parts of the algorithm in the context of interpolant generation. I also thank the referees for numerous suggestions for improving the presentation.
- Kozen D, Complexity of Finitely Presented Algebras, Technical Report TR 76–294, Dept. of Computer Science, Cornell Univ., Ithaca, NY, 1976.Google Scholar
- Craigen D, Kromodimoelijo S, Meisels I, et al., Eves system description, Proc. Automated Deduction - CADE 11, LNAI 607, Ed. Kapur, Springer Verlag, 1992, 771–775.Google Scholar
- Zhang H, Implementing contextual rewriting, Proc. Third International Workshop on Conditional Term Rewriting Systems, Springer LNCS 656 (Eds. by Remy J L and Rusinowitch M), 1992, 363–377.Google Scholar
- Cocke J and Schwartz J T, Programming Languages and Their Compilers: Preliminary Notes, Second Revised Version, Courant Institute of Mathematical Sciences, NY, 1970.Google Scholar
- Zhang H and Kapur D, First order theorem proving using conditional rewrite rules, Proc. 9th Intl. Conf. on Automated Deduction (CADE), Springer LNCS 310, (Eds. by Lusk E W and Overbeek R A), Argonne, USA, May, 1988, 1–20.Google Scholar
- Bachmair L, Ganzinger H, Lynch C, et al., Basic paramodulation and superposition, Proc. Automated Deduction — CADE 12, LNAI 607 (Ed. by Kapur), Springer Verlag, 1992, 462–476.Google Scholar
- Knuth D and Bendix P, Simple word problems in universal algebras, Computational Problems in Abstract Algebra (Ed. by Leech), Pergamon Press, 1970, 263–297.Google Scholar
- Dershowitz N, Canonical sets of Horn clauses, Proc. 18th ICALP, LNCS 510, 1991, 267–278.Google Scholar
- Bonacina M P and Dershowitz N, Canonical ground Horn theories, Ganzinger Festchrift, LNCS 7797, 2013, 39–69.Google Scholar
- Kapur D, Efficient Interpolant generation algorithms based on quantifier elimination: EUF, Octagons,..., Proc. Dagstuhl Seminar 17371–Deduction beyond First-order Logic, Wadern, Germany, Sep. 2017, A journal version is under preparation; a draft can be obtained from the author.Google Scholar
- Kandri-Rody A, Kapur D, and Narendran P, An ideal-theoretic approach for word problems and unification problems over commutative algebras, Proc. First International Conference on Rewriting Techniques and Applications (RTA-85), Dijon, France (Eds. by Jouannaud and Musser), Springer LNCS 202, May 1985, 345–364.Google Scholar
- Gulwani S and Musuvathi M, Cover algorithms and their combination, Proc. 17th European Symposium on Programming, ESOP 2008, Springer LNCS, 2008, 193–207.Google Scholar