Generating polynomial orderings

DOI10.1016/0020-0190(94)90032-9zbMath0791.68092OpenAlexW2038571924MaRDI QIDQ1318775

Joachim Steinbach

Publication date: 4 April 1994

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(94)90032-9

zbMATH Keywords

simplex methodterminationterm rewriting systemspolynomial orderingssimplification orderingsreduction orderings

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (7)

Termination of constructor systems ⋮ Polynomials over the reals in proofs of termination : from theory to practice ⋮ Automated Implicit Computational Complexity Analysis (System Description) ⋮ Termination of term rewriting using dependency pairs ⋮ On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting ⋮ Modular and incremental automated termination proofs ⋮ Modular termination proofs for rewriting using dependency pairs

Uses Software

• REVE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Termination of rewriting systems by polynomial interpretations and its implementation
• Automating the Knuth Bendix ordering
• Termination of rewriting
• A note on simplification orderings
• Termination proofs and the length of derivations

This page was built for publication: Generating polynomial orderings