Generating polynomial orderings for termination proofs
- 1 January 1995
- book chapter
- Published by Springer Nature
- p. 426-431
- https://doi.org/10.1007/3-540-59200-8_77
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Proving polynomials positivePublished by Springer Nature ,1992
- Rewrite SystemsPublished by Elsevier ,1990
- Termination of rewriting systems by polynomial interpretations and its implementationScience of Computer Programming, 1987
- Termination of rewritingJournal of Symbolic Computation, 1987
- Orderings for term-rewriting systemsTheoretical Computer Science, 1982
- Quantifier elimination for real closed fields by cylindrical algebraic decompostionPublished by Springer Nature ,1975
- A Decision Method for Elementary Algebra and GeometryPublished by University of California Press ,1951