Extensions and comparison of simplification orderings

DOI10.1007/3-540-51081-8_124OpenAlexW1939442430MaRDI QIDQ5055737FDOQ5055737

Authors: Joachim Steinbach 

Publication date: 9 December 2022

Published in: Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-51081-8_124

Recommendations

• Simplification orderings: Putting them to the test
• scientific article; zbMATH DE number 862680
• scientific article; zbMATH DE number 3930339
• scientific article; zbMATH DE number 3905845
• Termination orderings for associative-commutative rewriting systems

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cites Work

• Orderings for term-rewriting systems
• Verifying nilpotence
• Title not available (Why is that?)
• Title not available (Why is that?)
• Path of subterms ordering and recursive decomposition ordering revisited
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (29)

• Improving associative path orderings
• On the recursive decomposition ordering with lexicographical status and other related orderings
• On the complexity of recursive path orderings
• Total termination of term rewriting
• On the modularity of termination of term rewriting systems
• Termination proofs by multiset path orderings imply primitive recursive derivation lengths
• Path of subterms ordering and recursive decomposition ordering revisited
• Ordered chaining for total orderings
• Extending reduction orderings to ACU-compatible reduction orderings
• Title not available (Why is that?)
• Leanest quasi-orderings
• Simplification orderings: Putting them to the test
• Term Rewriting and Applications
• Termination proofs by multiset path orderings imply primitive recursive derivation lengths
• Linear interpretations by counting patterns
• Combinations of simplifying conditional term rewriting systems
• Termination of term rewriting by interpretation
• AC-termination of rewrite systems: a modified Knuth-Bendix ordering
• Extension orderings
• More on the order of prolongations and restrictions
• Automated Reasoning
• Time bounded rewrite systems and termination proofs by generalized embedding
• Incremental termination proofs and the length of derivations
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Pattern-matching algorithms based on term rewrite systems
• Maximal extensions of simplification orderings
• A comparison of refinement orderings and their associated simulation rules

This page was built for publication: Extensions and comparison of simplification orderings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5055737)