Termination orderings for associative-commutative rewriting systems
Journal of Symbolic Computation
Termination of rewriting systems by polynomial interpretations and its implementation
Science of Computer Programming
Associative-commutative reduction orderings
Information Processing Letters
A total AC-compatible ordering based on RPO
RTA-93 Selected papers of the fifth international conference on Rewriting techniques and applications
A New Method for Proving Termination of AC-Rewrite Systems
Proceedings of the Tenth Conference on Foundations of Software Technology and Theoretical Computer Science
Any Gound Associative-Commutative Theory Has a Finite Canonical System
RTA '91 Proceedings of the 4th International Conference on Rewriting Techniques and Applications
Extension of the Associative Path Ordering to a Chain of Associative Commutative Symbols
RTA '93 Proceedings of the 5th International Conference on Rewriting Techniques and Applications
A Total, Ground path Ordering for Proving Termination of AC-Rewrite Systems
RTA '97 Proceedings of the 8th International Conference on Rewriting Techniques and Applications
Proving Termination of Associative Commutative Rewriting Systems by Rewriting
Proceedings of the 8th International Conference on Automated Deduction
Orderings, AC-theories and Symbolic Constraint Solving
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Associative-commutative rewriting
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 2
Dependency Pairs for Equational Rewriting
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Improving Symbolic Model Checking by Rewriting Temporal Logic Formulae
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Equational Termination by Semantic Labelling
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
| Hi-index | 0.00 |
We present the first fully syntactic (i.e., non-interpretation-based) AC-compatible recursive path ordering (RPO). It is simple, and hence easy to implement, and its behaviour is intuitive as in the standard RPO. The ordering is AC-total, and defined uniformly for both ground and non-ground terms, as well as for partial precedences. More importantly, it is the first one that can deal incrementally with partial precedences, an aspect that is essential, together with its intuitive behaviour, for interactive applications like Knuth-Bendix completion.