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
Rouyer, Jocelyne
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 25 (1991), p. 157-169 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU)
Publié le : 1991-01-01
@article{ITA_1991__25_2_157_0,
     author = {Rouyer, Jocelyne},
     title = {Preuves de terminaison de syst\`emes de r\'e\'ecriture fond\'ees sur les interpr\'etations polynomiales. Une m\'ethode bas\'ee sur le th\'eor\`eme de Sturm},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     volume = {25},
     year = {1991},
     pages = {157-169},
     mrnumber = {1110982},
     zbl = {0731.68061},
     language = {fr},
     url = {http://dml.mathdoc.fr/item/ITA_1991__25_2_157_0}
}

Rouyer, Jocelyne. 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. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 25 (1991) pp. 157-169. http://gdmltest.u-ga.fr/item/ITA_1991__25_2_157_0/

1. A. Ben Cherifa and P. Lescanne, Termination of Rewriting by Polynomial Interpetretations and its Implementation, Sci. Comput. Programming, October 1987, Vol. 9 (2), pp. 137-160. | MR 912043 | Zbl 0625.68036

2. G. Collins, Quantifier Elimination for Real Closed Fields by Cylindrical Algebraic Decomposition, Proceedings 2nd GI Conference on Automata and Formal Languages, Springer Verlag, Lectures Notes in Computer Science 1975. | MR 403962 | Zbl 0318.02051

3. M. Davis, Y. Matijasevic and J. Robinson. Hilbert's Tenth Problem: Positive Aspects of a Negative Solution, in F. E. BROWDER Ed., Mathematical Developments Arising from Hubert Problems, American Mathematical Society, 1976, pp. 323-378. | MR 432534 | Zbl 0346.02026

4. N. Dershowitz, Corrigendum to Termination of Rewriting, J. Symbolic Comput., 1987, Vol. 4, pp. 409-410. | MR 925736 | Zbl 0637.68036

5. N. Dershowitz, Termination of Rewriting, J. Symbolic Comput., 1987, Vol. 3 (1 et 2), pp. 69-116. | MR 893186 | Zbl 0637.68035

6. D. Knuth, The Art of Computer Programming, Vol. 2, Addison Wesley, Reading Massachusetts, 2nd edition, 1981. | MR 633878 | Zbl 0477.65002

7. D. S. Lankford, On Proving Term Rewriting Systems are Noetherian, Technical Report, Louisiana Tech. University, Mathematics Dept., Ruston LA, 1979.

8. Tarski, A Decision Method for Elementary Algebra and Geometry, University of California Press, Berkeley, 2nd edition, 1951. | MR 44472 | Zbl 0044.25102