Semantic foundations of equality saturation

DOI10.4230/LIPICS.ICDT.2025.11MaRDI QIDQ7292777zbMATH OpenFDO

Authors Dan Suciu, Yisu Remy Wang, Yihong Zhang

Publication date 8 July 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ICDT.2025.11

Mathematics Subject Classification ID

Database theory (68P15)

Cites work

• A fast algorithm for generating reduced ground rewriting systems from a set of ground equations
• A generalization of Dijkstra's algorithm
• Abstract congruence closure
• All-instances termination of chase is undecidable
• Anatomy of the Chase
• Complexity of certain decision problems about congruential languages
• Data exchange: semantics and query answering
• Efficient E-Matching for SMT Solvers
• Equality saturation
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• scientific article; zbMATH DE number 58315 (Why is no real title available?)
• scientific article; zbMATH DE number 749931 (Why is no real title available?)
• Images of rigid digraphs
• Term Rewriting and All That
• Termination criteria for tree automata completion
• Variations on the Common Subexpression Problem

This page was built for publication: Semantic foundations of equality saturation

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