Predictive labeling

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

Volumn 4098 LNCS, Issue , 2006, Pages 313-327

  Hirokawa, Nao ^a   Middeldorp, Aart ^a  

^a UNIVERSITY OF INNSBRUCK   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAM LISTINGS; COMPUTER SIMULATION; MATHEMATICAL MODELS; SEMANTICS;

QUASI MODELS; REWRITE SYSTEMS; SEMANTIC LABELING; TRANSFORMATION TECHNIQUES;

DATABASE SYSTEMS;

EID: 33749385186     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11805618_24     Document Type: Conference Paper

References (19)

1. T. Arts and J. Giesl. Termination of term rewriting using dependency pairs. Theoretical Computer Science, 236:133-178, 2000.
2. F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge University Press, 1998.
3. A. Ben Cherifa and P. Lescanne. Termination of rewriting systems by polynomial interpretations and its implementation. Science of Computer Programming, 9:137-159, 1987.
4. N. Dershowitz. Orderings for term-rewriting systems. Theoretical Computer Science, 17:279-301, 1982.
5. A. Geser, D. Hofbauer, and J. Waldmann. Match-bounded string rewriting. Applicable Algebra in Engineering, Communication and Computing, 15:149-171, 2004.
6. A. Geser, D. Hofbauer, J. Waldmann, and H. Zantema. On tree automata that certify termination of left-linear term rewriting systems. In Proceedings of the 16th International Conference on Rewriting Techniques and Applications, volume 3467 of Lecture Notes Computer Science, pages 353-367, 2005.
7. B. Gramlich. Generalized sufficient conditions for modular termination of rewriting. Applicable Algebra in Engineering, Communication and Computing, 5:131-158, 1994.
8. N. Hirokawa and A. Middeldorp. Dependency pairs revisited. In Proceedings of the 16th International Conference on Rewriting Techniques and Applications, volume 3091 of Lecture Notes Computer Science, pages 249-268, 2004.
9. S. Kamin and J.J. Lévy. Two generalizations of the recursive path ordering. Unpublished manuscript, University of Illinois, 1980.
10. D.E. Knuth and P. Bendix. Simple word problems in universal algebras. In J. Leech, editor, Computational Problems in Abstract Algebra, pages 263-297. Pergamon Press, 1970.
11. A. Koprowski. TPA: Termination proved automatically. In Proceedings of the 17th International Conference on Rewriting Techniques and Applications, Lecture Notes Computer Science, 2006. This volume.
12. D. Lankford. On proving term rewriting systems are Noetherian. Technical Report MTP-3, Louisiana Technical University, 1979.
13. A. Middeldorp, H. Ohsaki, and H. Zantema. Transforming termination by self-labelling. In Proceedings of the 13th International Conference on Automated Deduction, volume 1104 of Lecture Notes in Artificial Intelligence, pages 373-386, 1996.
14. Terese. Term Rewriting Systems, volume 55 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 2003.
15. R. Thiemann, J. Giesl, and P. Schneider-Kamp. Improved modular termination proofs using dependency pairs. In Proceedings of the 2nd International Joint Conference on Automated Reasoning, volume 3097 of Lecture Notes in Artificial Intelligence, pages 75-90, 2004.
16. Y. Toyama. Counterexamples to the termination for the direct sum of term rewriting systems. Information Processing Letters, 25:141-143, 1987.
17. X. Urbain. Modular & incremental automated termination proofs. Journal of Automated Reasoning, 32:315-355, 2004.
18. H. Zantema. Termination of term rewriting by semantic labelling. Fundamenta Informaticae, 24:89-105, 1995.
19. H. Zantema. TORPA: Termination of rewriting proved automatically. In Proceedings of the 15th International Conference on Rewriting Techniques and Applications, Lecture Notes Computer Science, pages 95-104, 2004.