Simplification orderings: Putting them to the test

DOI10.1007/BF00881798MaRDI QIDQ1311404zbMATH OpenOpenAlexFDO

Authors Joachim Steinbach

Publication date 13 January 1994

Published in Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00881798

zbMATH Keywords

simplification orderingsreduction orderingdecomposition orderingspath orderingstermination of term rewriting systems

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Extensions and comparison of simplification orderings
• scientific article; zbMATH DE number 794239
• scientific article; zbMATH DE number 3930339
• scientific article; zbMATH DE number 1774211
• scientific article; zbMATH DE number 3905845

Cites work

• scientific article; zbMATH DE number 3810909 (Why is no real title available?)
• scientific article; zbMATH DE number 3299786 (Why is no real title available?)
• On recursive path ordering
• On the recursive decomposition ordering with lexicographical status and other related orderings
• Orderings for term-rewriting systems
• Path of subterms ordering and recursive decomposition ordering revisited
• Simplification orderings: Putting them to the test
• Termination of rewriting

Cited in

(6)

• Path of subterms ordering and recursive decomposition ordering revisited
• Extensions and comparison of simplification orderings
• Simplification orderings: Putting them to the test
• Solving simplification ordering constraints
• scientific article; zbMATH DE number 794239 (Why is no real title available?)
• scientific article; zbMATH DE number 3860380 (Why is no real title available?)

This page was built for publication: Simplification orderings: Putting them to the test

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