scientific article
From MaRDI portal
Publication:3779786
zbMath0638.68108MaRDI QIDQ3779786
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (15)
Termination proofs and the length of derivations ⋮ Extensions and comparison of simplification orderings ⋮ Termination of constructor systems ⋮ A geometrical approach to multiset orderings ⋮ Applying term rewriting methods to finite groups ⋮ AC-Termination of rewrite systems: A modified Knuth-Bendix ordering ⋮ Orienting rewrite rules with the Knuth-Bendix order. ⋮ An upper bound on the derivational complexity of Knuth-Bendix orderings. ⋮ Towards automated deduction in cP systems ⋮ About the descriptive power of certain classes of finite string-rewriting systems ⋮ Automating the Knuth Bendix ordering ⋮ Rational languages defined with a non-associative concatenation ⋮ Set of support, demodulation, paramodulation: a historical perspective ⋮ Generating polynomial orderings ⋮ Proving termination of (conditional) rewrite systems. A semantic approach
This page was built for publication:
