On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting
From MaRDI portal
Publication:2502172
DOI10.1007/s00200-005-0189-5zbMath1103.68061OpenAlexW2007941273MaRDI QIDQ2502172
Publication date: 12 September 2006
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00200-005-0189-5
Related Items (4)
Search Techniques for Rational Polynomial Orders ⋮ Increasing Interpretations ⋮ Proving Termination of Context-Sensitive Rewriting with MU-TERM ⋮ Real or natural number interpretation and their effect on complexity
Uses Software
Cites Work
- Termination of rewriting systems by polynomial interpretations and its implementation
- Mechanically proving termination using polynomial interpretations
- A note on simplification orderings
- Simulation of Turing machines by a regular rewrite rule
- Generating polynomial orderings
- Weights for total division orderings on strings
- Analysing the implicit complexity of programs.
- Invariants, patterns and weights for ordering terms
- Termination of term rewriting using dependency pairs
- Algorithms with polynomial interpretation termination proof
- On the combinatorial and algebraic complexity of quantifier elimination
- Termination proofs and the length of derivations
- Generating polynomial orderings for termination proofs
- Automated Reasoning
- Polynomials over the reals in proofs of termination : from theory to practice
- Term Rewriting and Applications
- Term Rewriting and Applications
- The classification of polynomial orderings on monadic terms
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting
