Author:
Kaji Yuichi,Kasami Toru,Fujiwara Tom
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Chabin J. and Réty P.: “Narrowing Directed by a Graph of Terms”, Proc. of the Fourth Intl. Conf. on RTA, Como, Italy, Lecture Notes in Computer Sciences 488, pp.112–123 (1991).
2. Comon H., Haberstrau M. and Jouannaud J.P.: “Decidable Problems in Shallow Equational Theories”, Proc. of Seventh Annual IEEE Symposium on Logic in Computer Science, Santa Cruz, California, pp.255–265 (June 1992).
3. Dershowitz N. and Jouannaud J.P.: “Rewrite Systems”, Handbook of Theoretical Computer Science, Vol. B, North-Holland (1990).
4. Dershowitz N. and Sivakumar G.: “Solving Goals in Equational Languages”, Proc. First Workshop of CTRS, Lecture Notes in Computer Science 308, pp.45–55 (1987).
5. Fay M.: “First-order Unification in an Equational Theory”, Proc. Fourth Workshop on Automated Deduction, Austin, Texas, pp.161–167 (Feb. 1979).
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献