How to Choose Weights in the Knuth Bendix Ordering

Authors:
Ursula Martin
Affiliations:
-
Venue:
RTA '87 Proceedings of the 2nd International Conference on Rewriting Techniques and Applications
Year:
1987

Citing 0
Cited 4

What You Always Wanted to Know about Rigid E-Unification

Journal of Automated Reasoning
An upper bound on the derivational complexity of Knuth--Bendix orderings

Information and Computation - Special issue: ICC '99
Orienting rewrite rules with the Knuth--Bendix order

Information and Computation - RTA 2001
Knuth--bendix constraint solving is NP-complete

ACM Transactions on Computational Logic (TOCL)

Quantified Score

Hi-index	0.00

Visualization

Abstract