Pages that link to "Item:Q5055737"
From MaRDI portal
The following pages link to Extensions and comparison of simplification orderings (Q5055737):
Displaying 24 items.
- Extending reduction orderings to ACU-compatible reduction orderings (Q293311) (← links)
- On the complexity of recursive path orderings (Q685537) (← links)
- Leanest quasi-orderings (Q876045) (← links)
- On the recursive decomposition ordering with lexicographical status and other related orderings (Q912609) (← links)
- More on the order of prolongations and restrictions (Q952797) (← links)
- Path of subterms ordering and recursive decomposition ordering revisited (Q1099655) (← links)
- Termination proofs by multiset path orderings imply primitive recursive derivation lengths (Q1200982) (← links)
- Simplification orderings: Putting them to the test (Q1311404) (← links)
- On the modularity of termination of term rewriting systems (Q1349693) (← links)
- Pattern-matching algorithms based on term rewrite systems (Q1575262) (← links)
- A comparison of refinement orderings and their associated simulation rules (Q2844831) (← links)
- (Q3327710) (← links)
- Incremental termination proofs and the length of derivations (Q5055748) (← links)
- Time bounded rewrite systems and termination proofs by generalized embedding (Q5055749) (← links)
- Total termination of term rewriting (Q5055796) (← links)
- Linear interpretations by counting patterns (Q5055811) (← links)
- Termination proofs by multiset path orderings imply primitive recursive derivation lengths (Q5096206) (← links)
- AC-Termination of rewrite systems: A modified Knuth-Bendix ordering (Q5096208) (← links)
- Ordered chaining for total orderings (Q5210789) (← links)
- Automated Reasoning (Q5307049) (← links)
- Term Rewriting and Applications (Q5703873) (← links)
- Combinations of simplifying conditional term rewriting systems (Q5881179) (← links)
- Termination of term rewriting by interpretation (Q5881183) (← links)
- Improving associative path orderings (Q6488548) (← links)
