Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Computational Theory and Mathematics,Software
Reference34 articles.
1. Arts, T. and Giesl, J.: Modularity of termination using dependency pairs, in T. Nipkow (ed.),9th International Conference on Rewriting Techniques and Applications, Lecture Notes in Computer Science 1379, Tsukuba, Japan, 1998, pp. 226–240.
2. Arts, T. and Giesl, J.: Termination of term rewriting using dependency pairs,Theoretical Computer Science 236 (2000), 133–178.
3. Brralleras, C, Ferreira, M. and Rubio, A.: Complete monotonic semantic path orderings, in D. Mc Allester (ed.),17th International Conference on Automated Deduction, Lecture Notes in Computer Science 1831, Pittsburgh, PA, USA, 2000.
4. Borralleras, C. and Rubio, A.: Termptation, in A. Rubio (ed.), Extended Abstracts of the 6th International Workshop on Termination, WST’03, Technical Report DSIC 11/15/03, Universidad Politécnica de Valencia, Spain, 2003, pp. 61–63.
5. Contejean, E., Marché, C, Monaté, B. and Urbain, X.: CiME version 2, 2000. Available at http://cime.lri.fr/.
Cited by
30 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献