scientific article; zbMATH DE number 2090320
From MaRDI portal
Publication:4809079
zbMATH Open1072.68581MaRDI QIDQ4809079FDOQ4809079
Authors:
Publication date: 12 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2392/23920471.htm
Title of this publication is not available (Why is that?)
Recommendations
Grammars and rewriting systems (68Q42) Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35)
Cited In (7)
- Term Rewriting and Applications
- Non-disjoint combined unification and closure by equational paramodulation
- Terminating non-disjoint combined unification
- Permutative rewriting and unification
- Computing knowledge in equational extensions of subterm convergent theories
- Unification and matching in hierarchical combinations of syntactic theories
- Lower bounds for runtime complexity of term rewriting
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4809079)