Abstract congruence closure and specializations

DOI10.1007/10721959_5MaRDI QIDQ2723409zbMATH OpenFDO

Authors Leo Bachmair, Ashish Tiwari

Publication date 5 July 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Subalgebras, congruence relations (08A30) Symbolic computation and algebraic computation (68W30)

Recommendations

• Abstract congruence closure
• Shostak's congruence closure as completion
• Fast congruence closure and extensions
• Artificial Intelligence and Symbolic Computation
• Conditional congruence closure over uninterpreted and interpreted symbols

Cited in

(15)

• On the relationship of congruence closure and unification
• A rewriting approach to satisfiability procedures.
• Abstract congruence closure
• Conditional congruence closure over uninterpreted and interpreted symbols
• Congruent closure algorithms for finite automata and some applications
• Deciding confluence of certain term rewriting systems in polynomial time
• Congruence classes with logic variables
• Congruence closure with integer offsets
• Combining equational reasoning
• Automatic Abstraction for Congruences
• A theory of using history for equational systems with applications
• Shostak's congruence closure as completion
• Artificial Intelligence and Symbolic Computation
• Modularity and Combination of Associative Commutative Congruence Closure Algorithms enriched with Semantic Properties
• Fast congruence closure and extensions

Describes a project that uses

Uses Software

• Maude

This page was built for publication: Abstract congruence closure and specializations

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