Author:
Nieuwenhuis Robert,Rivero José Miguel
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference18 articles.
1. Solving symbolic ordering constraints;Comon;Internat. J. Found. Comput. Sci.,1990
2. Comon, H., Narendran, P., Nieuwenhuis, R., and Rusinowitch, M.1998, Decision problems in ordered rewriting. In 13th IEEE Symposium on Logic in Computer Science (LICS), Indianapolis, IN, June 27–30, pp. 410–422.
3. Ordering constraints on trees;Comon;Proc. of Colloquium on Trees in Algebra and Programming (CAAP),1994
4. Termination of rewriting;Dershowitz;J. Symbolic Comput.,1987
5. Dershowitz, N., and Jouannaud, J.-P.1990, Rewrite systems. In Handbook of Theoretical Computer Science, Vol. B, Formal Models and SemanticsJ. van Leeuwen, Ed., Chap. 6, pp. 244–320, Elsevier Science, Amsterdam/New York/Oxford/Tokyo.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献