Most systems for the automation of termination proofs using polynomial orderings are only semi-automatic, i.e. the "right" polynomial ordering has to be given by the user. We show that a variation of Lank-ford's partial derivative technique leads to an easier and slightly more powerful method than most other semi-automatic approaches. Based on this technique we develop a method for the automated synthesis of a suited polynomial ordering.
CITATION STYLE
Giesl, J. (1995). Generating polynomial orderings for termination proofs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 914, pp. 426–431). Springer Verlag. https://doi.org/10.1007/3-540-59200-8_77
Mendeley helps you to discover research relevant for your work.