Polynomials over the reals in proofs of termination: From theory to practice

RAIRO - Theoretical Informatics and Applications

Volumn 39, Issue 3, 2005, Pages 547-586

  Lucas, Salvador ^a  

^a UNIVERSITAT POLITÈCNICA DE VALÈNCIA   (Spain)

Author keywords

Algebraic interpretations; Polynomial orderings; Rewriting; Termination

Indexed keywords

ALGEBRA; PROBLEM SOLVING; SYNTACTICS;

ALGEBRAIC INTERPRETATIONS; INNERMOST REWRITING; POLYNOMIAL ORDERINGS; REWRITING; TERMINATION PROBLEMS;

POLYNOMIALS;

EID: 22944474618     PISSN: 09883754     EISSN: 28047346     Source Type: Journal    
DOI: 10.1051/ita:2005029     Document Type: Conference Paper

References (44)

1. T. Arts and J. Giesl, Termination of Term Rewriting Using Dependency Pairs. Theor. Comput. Sci. 236 (2000) 133-178.
2. T. Arts and J. Giesl, A collection of examples for termination of term rewriting using dependency pairs. Technical report, AIB-2001-09, RWTH Aachen, Germany (2001).
3. J. Bochnak, M. Coste and M-F. Roy, Géométrie algébraique réelle. Springer-Verlag, Berlin (1987).
4. C. Borralleras, S. Lucas and A. Rubio, Recursive Path Orderings can be Context-Sensitive, in Proc. of 18th International Conference on Automated Deduction, CADE'02, edited by A. Voronkov, Springer-Verlag, Berlin. LNAI 2392 (2002) 314-331.
5. F. Baader and T. Nipkow, Term Rewriting and All That. Cambridge University Press (1998).
6. A. ben Cherifa and P. Lescanne, Termination of rewriting systems by polynomial interpretations and its implementation. Sci. Comput. Program. 9 (1987) 137-160.
7. A. Cichon and P. Lescanne, Polynomial interpretations and the complexity of algorithms, in Proc. of 11th International Conference on Automated Deduction, CADE'92, edited by D. Kapur, Springer-Verlag, Berlin. LNAI 607 (1992) 139-147.
8. E. Contejean and C. Marché, B. Monate and X. Urbain, Proving termination of rewriting with CiME, in Proc. of 6th International Workshop on Termination, WST'03, edited by A. Rubio, Technical Report DSIC 11/15/03, Valencia, Spain (2003) 71-73. Available at http://cime.lri.fr
9. E. Contejean, C. Marché, A.-P. Tomás and X. Urbain, Mechanically proving termination using polynomial interpretations. Research Report 1382, LRI, Université de Paris-Sud (2004).
10. M. Dauchet, Simulation of turing machines by a regular rewrite rule. Theor. Comput. Sci. 103 (1992) 409-420.
11. N. Dershowitz, A note on simplification orderings. Inform. Proc. Lett. 9 (1979) 212-215.
12. N. Dershowitz, Orderings for term rewriting systems. Theor. Comput. Sci. 17 (1982) 279-301.
13. N. Dershowitz, Termination of rewriting. J. Symbol. Comput. 3 (1987) 69-115.
14. N. Dershowitz, S. Kaplan and D. Plaisted, Rewrite, rewrite, rewrite, rewrite, rewrite. Theor. Comput. Sci. 83 (1991) 71-96.
15. M.-L. Fernández, Relaxing monotonicity for innermost termination. Inform. Proc. Lett. 98 (2005) 117-123.
16. J. Giesl, T. Arts and E. Ohlebusch, Modular Termination Proofs for Rewriting Using Dependency Pairs. J. Symbol. Comput. 38 (2002) 21-58.
17. A. Geser, Relative Termination. Ph.D. Thesis. Fakultät für Mathematik und Informatik. Universität Passau (1990).
18. J. Giesl, Generating Polynomial Orderings for Termination Proofs, in Proc. of 6th International Conference on Rewriting Techniques and Applications, RTA '95, edited by J. Hsiang, Springer-Verlag, Berlin. Lect. Notes Comput. Sci. 914 (1995) 426-431.
19. B. Gramlich and S. Lucas, Simple termination of context-sensitive rewriting, in Proc. of 3rd ACM SIGPLAN Workshop on Rule-based Programming, RULE'02 ACM Press, New York (2002) 29-41.
20. J. Giesl and A. Middeldorp, Transformation Techniques for Context-Sensitive Rewrite Systems. J. Funct. Program. 14 (2004) 379-427.
21. J. Giesl, R. Thiemann, P. Schneider-Kamp and S. Falke, Automated Termination Proofs with AProVE, in Proc. of 15h International Conference on Rewriting Techniques and Applications, RTA'04, edited by V. van Oostrom, Springer-Verlag, Berlin. Lect. Notes. Comput. Sci. 3091 (2004) 210-220. Available at http://www-12.Informatik.rwth-aachen.de/AProVE
22. H. Hong and D. Jakus, Testing Positiveness of Polynomials. J. Automated Reasoning 21 (1998) 23-38.
23. D. Hofbauer and C. Lautemann, Termination proofs and the length of derivations, in Proc. of the 3rd International Conference on Rewriting Techniques and Applications, RTA '89, edited by N. Dershowitz, Springer-Verlag, Berlin. Lect. Notes Comput. Sci. 355 (1989) 167-177.
24. N. Hirokawa and A. Middeldorp, Dependency Pairs Revisited, in Proc. of 15h International Conference on Rewriting Techniques and Applications, RTA '04, edited by V. van Oostrom, Springer-Verlag, Berlin. Lect. Notes. Comput. Sci. 3091 (2004) 249-268.
25. N. Hirokawa and A. Middeldorp, Polynomial Interpretations with Negative Coefficients, in Proc. of the 7th International Conference on Artificial Intelligence and Symbolic Computation, AISC'04, edited by B. Buchberger and J.A. Campbell, Springer-Verlag, Berlin. LNAI 3249 (2004) 185-198.
26. N. Hirokawa and A. Middeldorp, Tyrolean Termination Tool, in Proc. of 16th International Conference on Rewriting Techniques and Applications, RTA'05, edited by J. Giesl. Lect. Notes. Comput. Sci., to appear (2005). Available at http://c12-informatik.uibk.ac.at
27. D. Hofbauer, Termination Proofs by Context-Dependent Interpretations, in Proc. of 12th International Conference on Rewriting Techniques and Applications, RTA'01, edited by A. Middeldorp, Springer-Verlag, Berlin, Lect. Notes Comput. Sci. 2051 (2001) 108-121.
28. D.E. Knuth and P.E. Bendix, Simple Word Problems in Universal Algebra, in Computational Problems in Abstract Algebra, edited by J. Leech, Pergamon Press (1970) 263-297.
29. K. Kusakari, M. Nakamura and Y. Toyama, Argument Filtering Transformation, in International Conference on Principles and Practice of Declarative Programming, PPDP'99, edited by G. Nadathur, Springer-Verlag, Berlin. Lect. Notes Comput. Sci. 1702 (1999) 47-61.
30. D.S. Lankford, On proving term rewriting systems are noetherian. Technical Report, Louisiana Technological University, Ruston, LA (1979).
31. S. Lang, Algebra. Springer-Verlag, Berlin (2004).
32. S. Lucas, Context-sensitive computations in functional and functional logic programs. J. Funct. Logic Program. 1998 (1998) 1-61.
33. S. Lucas, Context-Sensitive Rewriting Strategies. Inform. Comput. 178 (2002) 293-343.
34. S. Lucas, Termination of (Canonical) Context-Sensitive Rewriting, in Proc. 13th International Conference on Rewriting Techniques and Applications, RTA '02, edited by S. Tison, Springer-Verlag, Berlin. Lect. Notes Comput. Sci. 2378 (2002) 296-310.
35. S. Lucas, MU-TERM: A Tool for Proving Termination of Context-Sensitive Rewriting, in Proc. of 15h International Conference on Rewriting Techniques and Applications, RTA'04, edited by V. van Oostrom, Springer-Verlag, Berlin. Lect. Notes Comput. Sci. 3091 (2004) 200-209. Available at http://www.daic.upv.es/ slucae/car/termination/muterm
36. S. Lucas, Proving Termination of Context-Sensitive Rewriting by Transformation. Technical Report DSIC-II/18/04, DSIC, Universidad Politécnica de Valencia (2004).
37. E. Ohlebusch, Advanced Topics in Term Rewriting. Springer-Verlag, Berlin (2002).
38. J.P. Rellier, CON'FLEX. INRA, France, 1996. Main URL:http://www.inra.fr/ bia/T/rellier/Logiciels/conflex/welcome.html
39. J. Steinbach, Generating Polynomial Orderings. Inform. Proc. Lett. 49 (1994) 85-93.
40. J. Steinbach, Simplification orderings: History of results. Fundamenta, Informaticae 24 (1995) 47-88.
41. A. Tarski, A Decision Method for Elementary Algebra and Geometry. Second Edition. University of California Press, Berkeley (1951).
42. R. Thiemann, J. Giesl and P. Schneider-Kamp, Improved Modular Termination Proofs Using Dependency Pairs, in Proc. of 2nd International Joint Conference on Automated Reasoning, IJCAR'04, edited by D.A. Basin and M. Rusinowitch, Springer-Verlag, Berlin. Lect. Notes Comput. Sci. 3097 (2004) 75-90.
43. H. Zantema, Termination of Context-Sensitive Rewriting, in Proc. of 8th International Conference on Rewriting Techniques and Applications, RTA '97, edited by H. Comon, Springer-Verlag, Berlin. Lect. Notes Comput. Sci. 1232 (1997) 172-186.
44. H. Zantema, Termination, in Term Rewriting Systems, Chap. 6. edited by TeReSe, Cambridge University Press (2003).