scientific article; zbMATH DE number 2090320
From MaRDI portal
Publication:4809079
zbMath1072.68581MaRDI QIDQ4809079
No author found.
Publication date: 12 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2392/23920471.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35) Grammars and rewriting systems (68Q42)
Related Items (6)
Non-disjoint combined unification and closure by equational paramodulation ⋮ Lower bounds for runtime complexity of term rewriting ⋮ Permutative rewriting and unification ⋮ Unification and Matching in Hierarchical Combinations of Syntactic Theories ⋮ Computing knowledge in equational extensions of subterm convergent theories ⋮ Terminating non-disjoint combined unification
This page was built for publication:
