scientific article; zbMATH DE number 4041334
From MaRDI portal
Publication:3779786
zbMATH Open0638.68108MaRDI QIDQ3779786FDOQ3779786
Authors: Ursula Martin Webb
Publication date: 1987
Title of this publication is not available (Why is that?)
Recommendations
Cited In (17)
- Set of support, demodulation, paramodulation: a historical perspective
- Termination proofs and the length of derivations
- Ordered rewriting and confluence
- Towards automated deduction in cP systems
- An upper bound on the derivational complexity of Knuth-Bendix orderings.
- Extensions and comparison of simplification orderings
- Orienting rewrite rules with the Knuth-Bendix order.
- Things to know when implementing KBO
- Proving termination of (conditional) rewrite systems. A semantic approach
- Generating polynomial orderings
- Termination of constructor systems
- Automating the Knuth Bendix ordering
- AC-termination of rewrite systems: a modified Knuth-Bendix ordering
- About the descriptive power of certain classes of finite string-rewriting systems
- Applying term rewriting methods to finite groups
- Rational languages defined with a non-associative concatenation
- A geometrical approach to multiset orderings
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 Q3779786)