Decidability of Termination for Semi-constructor TRSs, Left-Linear Shallow TRSs and Related Systems-Reference-Cited by-同舟云学术

Decidability of Termination for Semi-constructor TRSs, Left-Linear Shallow TRSs and Related Systems

Published:2006 Issue: Volume: Page:343-356
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Wang Yi,Sakai Masahiko

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11805618_26.pdf

Reference13 articles.

1. Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theoretical Computer Science 236, 133–178 (2000)

2. Baader, F., Nipkow, T.: Term rewriting and all that. Cambridge University Press, Cambridge (1998)

3. Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (1997), http://www.grappa.univ-lille3.fr/tata/

4. Lecture Notes in Computer Science;N. Dershowitz,1981

5. Lecture Notes in Artificial Intelligence;G. Godoy,2005

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Termination of Rewriting with Right-Flat Rules Modulo Permutative Theories;Logical Methods in Computer Science;2010-08-25

2. Decidability of Termination and Innermost Termination for Term Rewriting Systems with Right-Shallow Dependency Pairs;IEICE Transactions on Information and Systems;2010

3. Undecidable properties of flat term rewrite systems;Applicable Algebra in Engineering, Communication and Computing;2009-04-21

4. Unique Normalization for Shallow TRS;Rewriting Techniques and Applications;2009

5. Termination of Rewriting with Right-Flat Rules;Lecture Notes in Computer Science