Congruence Closure of Compressed Terms in Polynomial Time
From MaRDI portal
Publication:3172897
DOI10.1007/978-3-642-24364-6_16zbMATH Open1348.68085OpenAlexW85844715MaRDI QIDQ3172897FDOQ3172897
Manfred Schmidt-Schauß, Altug Anis, David Sabel
Publication date: 7 October 2011
Published in: Frontiers of Combining Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-24364-6_16
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Variations on the Common Subexpression Problem
- Solving SAT and SAT Modulo Theories
- An algorithm for finding canonical sets of ground rewrite rules in polynomial time
- A universal algorithm for sequential data compression
- Term Rewriting and All That
- Fast Decision Procedures Based on Congruence Closure
- Unification and matching on compressed terms
- Processing Compressed Texts: A Tractability Border
- Database Programming Languages
- A fast algorithm for generating reduced ground rewriting systems from a set of ground equations
- On the complexity of bounded second-order unification and stratified context unification
- Bounded Second-Order Unification Is NP-Complete
- Parameter Reduction in Grammar-Compressed Trees
- First-Order Unification on Compressed Terms
- Word Problems and Membership Problems on Compressed Words
- Stratified Context Unification Is NP-Complete
- An algorithm for reasoning about equality
Cited In (4)
Uses Software
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)
