Author:
Limet Sébastien,Réty Pierre
Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. J. Christian. Some Termination Criteria for Narrowing and E-Unification. In Saragota Springs, editor, CADE, Albany (NY, USA), volume 607 of LNAI, pages 582–588. Springer-Verlag, 1992.
2. H. Comon, M. Haberstrau, and J.-P. Jouannaud. Syntacticness, Cycle-Syntacticness and Shallow Theories. Information and Computation, 111(1):154–191, 1994.
3. N. Dershowitz and J.-P. Jouannaud. Rewrite Systems. In J. Van Leuven, editor, Handbook of Theoretical Computer Science. Elsevier Science Publishers, 1990.
4. H. Faßbender and S. Maneth. A strict border for the decidability of E-unification for recursive functions. In proceedings of the intern. Conf. on Algebraic and Logic Programming. To appear., 1996.
5. R. Gilleron, S. Tison, and M. Tommasi. Some new decidability results on positive and negative set constraints. In LNCS, volume 845, pages 336–351, 1994. First International Conference on Constraints in Computational Logics.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献