About the theory of tree embedding-Reference-Cited by-同舟云学术

About the theory of tree embedding

Published:1993 Issue: Volume: Page:376-390
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Boudet Alexandre,Comon Hubert

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-56610-4_77

Reference10 articles.

1. Hubert Comon. Solving symbolic ordering constraints. International Journal of Foundations of Computer Science, 1(4), 1990.

2. Hubert Comon. Disunification: a survey. In Jean-Louis Lassez and Gordon Plotkin, editors, Computational Logic: Essays in Honor of Alan Robinson. MIT Press, 1991.

3. Nachum Dershowitz and Jean-Pierre Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 243–309. North-Holland, 1990.

4. Graham Higman. Ordering by divisibility in abstract algebras. Proceedings of the London Mathematical Society, 2(3):326–336, September 1952.

5. Jean-Pierre Jouannaud and Claude Kirchner. Solving equations in abstract algebras: A rule-based survey of unification. In Jean-Louis Lassez and Gordon Plotkin, editors, Computational Logic: Essays in Honor of Alan Robinson. MIT-Press, 1991.

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The Use of Embeddings to Provide a Clean Separation of Term and Annotation for Higher Order Rippling;Journal of Automated Reasoning;2010-05-13

2. Theories of orders on the set of words;RAIRO - Theoretical Informatics and Applications;2005-10-15

3. Higher-order annotated terms for proof search;Lecture Notes in Computer Science;1996

4. Constraints in Term Algebras (Short Survey);Algebraic Methodology and Software Technology (AMAST’93);1994

5. Solving simplification ordering constraints;Constraints in Computational Logics