The following pages link to Generating polynomial orderings (Q1318775):
Displaying 13 items.
- Termination of rewriting systems by polynomial interpretations and its implementation (Q579930) (← links)
- Mechanically proving termination using polynomial interpretations (Q851142) (← links)
- Modular termination proofs for rewriting using dependency pairs (Q1864874) (← links)
- Termination of term rewriting using dependency pairs (Q1978641) (← links)
- On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting (Q2502172) (← links)
- Modular and incremental automated termination proofs (Q2583289) (← links)
- Preuves de terminaison de systèmes de réécriture fondées sur les interprétations polynomiales. Une méthode basée sur le théorème de Sturm (Q3357550) (← links)
- Automated Implicit Computational Complexity Analysis (System Description) (Q3541694) (← links)
- Generating polynomial orderings for termination proofs (Q5055845) (← links)
- Termination of constructor systems (Q5055852) (← links)
- Query order in the polynomial hierarchy (Q5055937) (← links)
- Foundations of Software Science and Computation Structures (Q5308459) (← links)
- Polynomials over the reals in proofs of termination : from theory to practice (Q5313720) (← links)
