共 50 条
- [31] PROOFS OF TERMINATION OF REWRITING-SYSTEMS BASED ON INTERPRETATION OF POLYNOMIALS - A METHOD BASED ON STURMS THEOREM RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1991, 25 (02): : 157 - 169
- [32] Polynomials for proving termination of context-sensitive rewriting FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, PROCEEDINGS, 2004, 2987 : 318 - 332
- [33] Revisiting Matrix Interpretations for Proving Termination of Term Rewriting 22ND INTERNATIONAL CONFERENCE ON REWRITING TECHNIQUES AND APPLICATIONS (RTA'11), 2011, 10 : 251 - 266
- [35] Certification of proving termination of term rewriting by matrix interpretations SOFSEM 2008: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2008, 4910 : 328 - 339
- [39] On proving termination by innermost termination REWRITING TECHNIQUES AND APPLICATIONS, 1996, 1103 : 93 - 107