A procedure for automatically proving the termination of a set of rewrite rules

Authors:
David Detlefs;Randy Forgaard
Affiliations:
Massachusetts Institute of Technology Laboratory for Computer Science, Cambridge;Massachusetts Institute of Technology Laboratory for Computer Science, Cambridge
Venue:
Proc. of the first international conference on Rewriting techniques and applications
Year:
1985

Completion for Multiple Reduction Orderings

Journal of Automated Reasoning
Heuristics and Experiments on BDD Representation of Boolean Functions for Expert Systems in Software Verification Domains

AI '99 Proceedings of the 12th Australian Joint Conference on Artificial Intelligence: Advanced Topics in Artificial Intelligence
Verifying Orientability of Rewrite Rules Using the Knuth-Bendix Order

RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
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)
Simplification Orderings: History Of Results

Fundamenta Informaticae

Hi-index	0.00