Author:
Habel Annegret,Plump Detlef
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Sergio Antoy, Rachid Echahed, and Michael Hanus. A needed narrowing strategy. In Proc. Symposium on Principles of Programming Languages, pages 268–279. ACM Press, 1994.
2. Franz Baader and Tobias Nipkow. Term Rewriting and All That. Cambridge University Press, 1998.
3. Franz Baader and Jöorg H. Siekmann. Unification theory. In D.M. Gabbay, C.J. Hogger, and J.A. Robinson, editors, Handbook of Logic in Articial Intelligence and Logic Programming, pages 41–125. Clarendon Press, 1994.
4. Alexander Bockmayr, Stefan Krischer, and Andreas Werner. Narrowing strategies for arbitrary canonical rewrite systems. Fundamenta Informaticae, 24:125–155, 1995.
5. Nachum Dershowitz and Jean-Pierre Jouannaud. Rewrite systems. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chapter 6, pages 244–320. Elsevier, 1990.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Rule-Based Procedure for Graph Query Solving;Graph Transformation;2023
2. Solving Equations by Graph Transformation;Electronic Notes in Theoretical Computer Science;2002-05
3. GETGRATS;Electronic Notes in Theoretical Computer Science;2002-05
4. Functional and Constraint Logic Programming;Constraints in Computational Logics;2001