Congruence closure with integer offsets
From MaRDI portal
Recommendations
Cited in
(7)- Delayed theory combination vs. Nelson-Oppen for satisfiability modulo theories: a comparative analysis
- Efficient theory combination via Boolean search
- Generalizing DPLL and satisfiability for equalities
- Rewrite-based satisfiability procedures for recursive data structures
- EufDPLL -- a tool to check satisfiability of equality logic formulas
- M\textbf{ath}SAT: Tight integration of SAT and mathematical decision procedures
- Fast congruence closure and extensions
This page was built for publication: Congruence closure with integer offsets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3408132)