Author:
Barguno Luis,Godoy Guillem,Huntingford Eduard,Tiwari Ashish
Publisher
Centre pour la Communication Scientifique Directe (CCSD)
Subject
General Computer Science,Theoretical Computer Science
Reference13 articles.
1. M. Bezem, J. W. Klop, and R. de Vrijer, editors.Term Rewriting Systems. Cambridge Tracts in Theoretical Computer Science 55. Cambridge University Press, 2003.
2. F. Baader and T. Nipkow.Term Rewriting and All That. Cambridge University Press, New York, 1998.
3. N. Dershowitz. Termination of linear rewriting systems. InProc. 8th Colloquium on Automata, Languages and Programming, ICALP, volume 115 ofLNCS, pages 448-458, 1981.
4. G. Godoy, E. Huntingford, and A. Tiwari. Termination of rewriting with right-flat rules. InProc. 18th Intl. Conf. on Rewriting Techniques and Applications, RTA, volume 4533 ofLNCS, pages 200-213, 2007.
5. G. Godoy and A. Tiwari. Deciding fundamental properties of right-(ground or variable) rewrite systems by rewrite closure. InProc. Intl. Joint Conf. on Automated Deduction, IJCAR, volume 3097 ofLNAI, pages 91-106. Springer, July 2004.