Graph unification and matching-Reference-Cited by-同舟云学术

Graph unification and matching

Published:1996 Issue: Volume: Page:75-88
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Plump Detlef,Habel Annegret

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-61228-9_80

Reference19 articles.

1. Franz Baader and Jörg 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, pages 41–125. Oxford University Press, 1994.

2. Michel Bauderon and Bruno Courcelle. Graph expressions and graph rewritings. Mathematical Systems Theory, 20:83–127, 1987.

3. Alexandre Boudet, Evelyne Contejean, and Hervé Devie. A new AC unification algorithm with an algorithm for solving systems of Diophantine equations. In Proc. Annual IEEE Symposium on Logic in Computer Science, pages 289–299, 1990.

4. Michael Clausen and Albrecht Fortenbacher. Efficient solution of linear Diophantine equations. Journal of Symbolic Computation, 8:201–216, 1989.

5. Evelyne Contejean. An efficient incremental algorithm for solving systems of linear Diophantine equations. Information and Computation, 113:143–172, 1994.

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

1. Shaped Generic Graph Transformation;Applications of Graph Transformations with Industrial Relevance;2008

2. Cloning and Expanding Graph Transformation Rules for Refactoring;Electronic Notes in Theoretical Computer Science;2006-03

3. Graph Transformation with Variables;Formal Methods in Software and Systems Modeling;2005

4. Parallel Independence in Hierarchical Graph Transformation;Lecture Notes in Computer Science;2004

5. Solving Equations by Graph Transformation;Electronic Notes in Theoretical Computer Science;2002-05