Innermost Termination of Rewrite Systems by Labeling

Electronic Notes in Theoretical Computer Science

Volumn 204, Issue C, 2008, Pages 3-19

  Thiemann, René ^a   Middeldorp, Aart ^a  

^a UNIVERSITY OF INNSBRUCK   (Austria)

Author keywords

Innermost Termination; Predictive Labeling; Semantic Labeling; Term Rewriting; Termination

Indexed keywords

COMPUTATIONAL GRAMMARS; COMPUTATIONAL METHODS; COMPUTER PROGRAMMING LANGUAGES; MATHEMATICAL MODELS;

INNERMOST TERMINATION; PREDICTIVE LABELING; SEMANTIC LABELING; TERM REWRITING;

SEMANTICS;

EID: 41649119139     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2008.03.050     Document Type: Article

References (9)

1. Arts T., and Giesl J. Termination of term rewriting using dependency pairs. Theoretical Computer Science 236 (2000) 133-178
2. Baader F., and Nipkow T. Term Rewriting and All That (1998), Cambridge University Press
3. Giesl J., Thiemann R., Schneider-Kamp P., and Falke S. Mechanizing and improving dependency pairs. Journal of Automated Reasoning 37 (2006) 155-203
4. Hirokawa N., and Middeldorp A. Predictive labeling. Proc. 17th International Conference on Rewriting Techniques and Applications. LNCS 4098 (2006) 313-327
5. Hirokawa N., and Middeldorp A. Tyrolean termination tool: Techniques and features. Information and Computation 205 (2007) 474-511
6. Koprowski A. TPA: Termination proved automatically. Proc. 17th International Conference on Rewriting Techniques and Applications. LNCS (2006) 266-275
7. Koprowski A., and Middeldorp A. Predictive labeling with dependency pairs using SAT. Proc. 21st International Conference on Automated Deduction. LNAI 4603 (2007) 410-425
8. Koprowski A., and Zantema H. Recursive path ordering for infinite labelled rewrite systems. Proc. 3rd International Joint Conference on Automated Reasoning. LNAI 4130 (2006) 332-346
9. Zantema H. Termination of term rewriting by semantic labelling. Fundamenta Informaticae 24 (1995) 89-105