Computing congruent closures on terms

DOI10.1007/BF02733112MaRDI QIDQ1280915zbMATH OpenFDO

Authors K. Appert, S. L. Krivoi

Publication date 28 April 1999

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02733112

zbMATH Keywords

computer algebrasymbolic computation

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Recommendations

• On the combination of congruence closure and completion
• Congruence closure of compressed terms in polynomial time
• Abstract congruence closure
• Computations with finite closure systems and implications
• Fast congruence closure and extensions
• Proof-producing congruence closure
• Computing congruence lattices of finite lattices
• Closed congruences on semigroups
• On computable aspects of algebraic and definable closure
• Congruence closure with free variables

Cites work

• scientific article; zbMATH DE number 3090158 (Why is no real title available?)
• Variations on the Common Subexpression Problem

Cited in

(9)

• On the relationship of congruence closure and unification
• Equality in computer algebra and beyond.
• Congruent closure algorithms for finite automata and some applications
• Intersection of term equality sets in finitely defined algebras
• Congruence classes with logic variables
• Extending finite model searching with congruence closure computation
• Proof-producing congruence closure
• Computations with finite closure systems and implications
• Modularity and Combination of Associative Commutative Congruence Closure Algorithms enriched with Semantic Properties

This page was built for publication: Computing congruent closures on terms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1280915)