Basic syntactic mutation
From MaRDI portal
Recommendations
Cited in
(10)- Terminating non-disjoint combined unification
- Lower bounds for runtime complexity of term rewriting
- Unification and matching in hierarchical combinations of syntactic theories
- Computing knowledge in equational extensions of subterm convergent theories
- Faster basic syntactic mutation with sorts for some separable equational theories
- Graph-embedded rewrite systems: combination and undecidability results
- Combining generalization algorithms in regular collapse-free theories
- Knowledge problems vs unification and matching: dichotomy results
- Non-disjoint combined unification and closure by equational paramodulation
- Permutative rewriting and unification
This page was built for publication: Basic syntactic mutation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4809079)