Generating polynomial orderings for termination proofs

DOI10.1007/3-540-59200-8_77zbMATH Open1503.68110OpenAlexW2149605327MaRDI QIDQ5055845FDOQ5055845

Authors: Jürgen Giesl 

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-59200-8_77

Recommendations

• Automatic termination proofs with transformation orderings
• Mechanically proving termination using polynomial interpretations
• Generating polynomial orderings
• Orderings and Constraints: Theory and Practice of Proving Termination
• Polynomials over the reals in proofs of termination : from theory to practice

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Cites Work

• Termination of rewriting systems by polynomial interpretations and its implementation
• Title not available (Why is that?)
• Orderings for term-rewriting systems
• Termination of rewriting
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (9)

• Orderings and Constraints: Theory and Practice of Proving Termination
• Polynomials over the reals in proofs of termination : from theory to practice
• On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting
• Termination analysis for partial functions
• Mechanically proving termination using polynomial interpretations
• Modular termination proofs for rewriting using dependency pairs
• Termination of term rewriting using dependency pairs
• Generating polynomial orderings
• Termination of constructor systems

This page was built for publication: Generating polynomial orderings for termination proofs

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