Author:
Faßbender Heinz,Maneth Sebastian
Publisher
Springer Berlin Heidelberg
Reference26 articles.
1. F. Baader and J.H. Siekmann. Unification theory. In D. M. Gabbay, C. J. Hogger, and J. A. Robinson, editors, Handbook of Logic in Artificial Intelligence and Logic Programming. Oxford Univ. Press, 1993.
2. H. Comon, M. Haberstrau, and J.-P. Jouannaud. Syntacticness, cycle-syntacticness, and shallow theories. Information and Computation, 111:154–191, 1994.
3. N. Dershowitz and J.P. Jouannaud. Rewrite systems. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Science, Vol. B, chapter 6, pages 243–320. Elsevier, 1990.
4. R. Echahed. On completeness of narrowing strategies. Theoret. Comput. Sci., 72:133–146, 1990.
5. J. Engelfriet. Bottom-up and top-down tree transformations — a comparison. Math. Systems Theory, 9(3):198–231, 1975.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A general framework for R-unification problems;Principles of Declarative Programming;1998
2. E-unification by means of tree tuple synchronized grammars;TAPSOFT '97: Theory and Practice of Software Development;1997