Polynomial Interpretations with Negative Coefficients

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3249, Issue , 2004, Pages 185-198

  Hirokawa, Nao ^a   Middeldorp, Aart ^a  

^a UNIVERSITY OF INNSBRUCK   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE;

BINARY FUNCTIONS; NEGATIVE COEFFICIENTS; POLYNOMIAL INTERPRETATIONS; REWRITE SYSTEMS; TERM REWRITE SYSTEMS; UNARY FUNCTIONS;

POLYNOMIALS;

EID: 35048902099     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30210-0_16     Document Type: Article

References (24)

1. T. Arts and J. Giesl. Termination of term rewriting using dependency pairs. Theoretical Computer Science, 236:133-178, 2000.
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, 2001.
3. F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge University Press, 1998.
4. A. Ben Cherifa and P. Lescanne. Termination of rewriting systems by polynomial interpretations and its implementation. Science of Computer Programming, 9:137159, 1987.
5. E. Contejean, C. Marché, B. Monate, and X. Urbain. CiME version 2, 2000. Available at http://cime.lri.fr/.
6. E. Contejean, G. Marché, A.-P. Tomás, and X. Urbain. Mechanically proving termination using polynomial interpretations. Research Report 1382, LRI, 2004.
7. N. Dershowitz. 33 Examples of termination. In French Spring School of Theoretical Computer Science, volume 909 of LNCS, pages 16-26, 1995.
8. N. Dershowitz and C. Hoot. Natural termination. Theoretical Computer Science, 142(2):179-207, 1995.
9. J. Giesl. Generating polynomial orderings for termination proofs. In Proc. 6th RTA, volume 914 of LNCS, pages 426-431, 1995.
10. J. Giesl, T. Arts, and E. Ohlebusch. Modular termination proofs for rewriting using dependency pairs. Journal of Symbolic Computation, 34(l):21-58, 2002.
11. J. Giesl, R. Thiemann, P. Schneider-Kamp, and S. Falke. Automated termination proofs with AProVE. In Proc. 15th RTA, volume 3091 of LNCS, pages 210-220, 2004.
12. N. Hirokawa and A. Middeldorp. Automating the dependency pah- method. In Proc. 19th CADE, volume 2741 of LNAI, pages 32-46, 2003.
13. N. Hirokawa and A. Middeldorp. Dependency pairs revisited. In Proc. 16th RTA, volume 3091 of LNCS, pages 249-268, 2004.
14. N. Hirokawa and A. Middeldorp. Tyrolean termination tool. In Proc. 7th Internation Workshop on Termination, Technical Report AIB-2004-07, RWTH Aachen, pages 59-62, 2004.
15. H. Hong and D. Jakus. Testing positiveness of polynomials. Journal of Automated Reasoning, 21:23-28, 1998.
16. D. Lankford. On proving term rewriting systems are Noetherian. Technical Report MTP-3, Louisiana Technical University, Ruston, LA, USA, 1979.
17. S. Lucas. Polynomials for proving termination of context-sensitive rewriting. In Proc. 7th FoSSaCS, volume 2987 of LNCS, pages 318-332, 2004.
18. S. Lucas. Polynomials over the reals in proof of termination. In Proc. 7th Internation Workshop on Termination, Technical Report AIB-2004-07, RWTH Aachen, pages 39-42, 2004.
19. J. Steinbach. Generating polynomial orderings. Information Processing Letters, 49:85-93, 1994.
20. J. Steinbach and U. Kühler. Check your ordering - termination proofs and open problems. Technical Report SR-90-25, Universität Kaiserslautern, 1990.
21. Terese. Term Rewriting Systems, volume 55 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 2003.
22. R. Thiemann, J. Giesl, and P. Schneider-Kamp. Improved modular termination proofs using dependency pairs. In Proc. 2nd IJCAR, volume 3097 of LNAI, pages 75-90, 2004.
23. X. Urbain. Modular & incremental automated termination proofs. Journal of Automated Reasoning, 2004. To appear.
24. H. Zantema. Termination of term rewriting by semantic labelling. Fundamenta Informaticae, 24:89-105, 1995.