Testing positiveness of polynomials

DOI10.1023/A:1005983105493zbMath0916.68084OpenAlexW1496103894MaRDI QIDQ1272602

Hoon Hong, Dalibor Jakuš

Publication date: 29 June 1999

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

Full work available at URL: https://doi.org/10.1023/a:1005983105493

zbMATH Keywords

term rewrite systemstermination proofspositiveness of polynomials

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Grammars and rewriting systems (68Q42)

Related Items (22)

Mechanically proving termination using polynomial interpretations ⋮ Polynomials over the reals in proofs of termination : from theory to practice ⋮ Tyrolean termination tool: techniques and features ⋮ Mechanizing and improving dependency pairs ⋮ Size-based termination of higher-order rewriting ⋮ Improved bounds on absolute positiveness of multivariate polynomials ⋮ Maximal Termination ⋮ Algorithms For Positive Polynomial Approximation ⋮ Efficient solution of a class of quantified constraints with quantifier prefix exists-forall ⋮ Beyond polynomials and Peano arithmetic -- automation of elementary and ordinal interpretations ⋮ A new algorithm for proving global asymptotic stability of rational difference equations ⋮ Automatic Proofs of Termination With Elementary Interpretations ⋮ Bounds on absolute positiveness of multivariate polynomials ⋮ Monotonicity Criteria for Polynomial Interpretations over the Naturals ⋮ A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs ⋮ Proving Termination of Integer Term Rewriting ⋮ Increasing interpretations ⋮ Termination Analysis of Logic Programs Based on Dependency Graphs ⋮ Search Techniques for Rational Polynomial Orders ⋮ Increasing Interpretations ⋮ Real or natural number interpretation and their effect on complexity ⋮ A complete superposition calculus for primal grammars

This page was built for publication: Testing positiveness of polynomials