Congruence closure of compressed terms in polynomial time
From MaRDI portal
Publication:3172897
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1408351 (Why is no real title available?)
- A fast algorithm for generating reduced ground rewriting systems from a set of ground equations
- A universal algorithm for sequential data compression
- An algorithm for finding canonical sets of ground rewrite rules in polynomial time
- An algorithm for reasoning about equality
- Bounded Second-Order Unification Is NP-Complete
- Database Programming Languages
- Fast Decision Procedures Based on Congruence Closure
- First-order unification on compressed terms
- On the complexity of bounded second-order unification and stratified context unification
- Parameter Reduction in Grammar-Compressed Trees
- Processing Compressed Texts: A Tractability Border
- Solving SAT and SAT modulo theories, from an abstract Davis-Putnam-Logemann-Loveland procedure to \(\operatorname{DPLL}(T)\)
- Stratified Context Unification Is NP-Complete
- Term Rewriting and All That
- Unification and matching on compressed terms
- Variations on the Common Subexpression Problem
- Word Problems and Membership Problems on Compressed Words
Cited in
(7)- Linear pattern matching of compressed terms and polynomial rewriting
- Grammar-Based Tree Compression
- Unification with Singleton Tree Grammars
- Computing congruent closures on terms
- Linear compressed pattern matching for polynomial rewriting (extended abstract)
- Approximation of smallest linear tree grammar
- NP-completeness of small conflict set generation for congruence closure
This page was built for publication: Congruence closure of compressed terms in polynomial time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3172897)
