Graph Unification and Matching

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1073, Issue , 1996, Pages 76-88

  Plump, Detlef ^a   Habel, Annegret ^b  

^a UNIVERSITY OF BREMEN   (Germany)

^b UNIVERSITY OF HILDESHEIM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

AS SUBSTITUTIONS; GRAPH MATCHINGS; GRAPH REWRITING; HYPEREDGE REPLACEMENT; HYPEREDGES; LINEAR DIOPHANTINE EQUATIONS; MATCHING PROBLEMS; TRANSFORMATION RULES;

FORMAL LANGUAGES;

EID: 84947704515     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61228-9_80     Document Type: Conference Paper

References (19)

1. Franz Baader and Jörg H. Siekmann. Unification theory. In D. M. Gabbay, C. J. ttogger, 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.
6. Jacques Corbin and Michel Bidoit. A rehabilitation of Robinson's unification algorithm. In R.E.A. Mason, editor, Proc. Information Processing 83, pages 909-914, 1983.
7. Hartmut Ehrig. Introduction to the algebraic theory of graph grammars. In Proc. Graph-Grammars and Their Application to Computer Science and Biology, pages 1-69. Springer Lecture Notes in Computer Science 73, 1979.
8. Warren D. Goldfarb. The undecidability of the second-order unification problem. Theoretical Computer Science, 13:225-230, 1981.
9. Annegret Habel. Hyperedge Replacement: Grammars and Languages, volume 643 of Lecture Notes in Computer Science. Springer-Verlag, 1992.
10. Annegret ttabel and Detlef Plump. Unification, rewriting, and narrowing on term graphs. In Proc. SEGRAGRA '95, Electronic Notes in Theoretical Computer Science. Elsevier, 1995. To appear.
11. Gérard P. Huet. Résolution d'equations dans les langages d'ordre 1,2,..,ω. Thèse d’état, Université de Paris VII, 1976.
12. Joxan Jaffar. Efficient unification over infinite terms. New Generation Computing, 2:207-219, 1984.
13. Joxan Jaffar. Minimal and complete word unification. Journal of the ACM, 37(1):47-85, 1990.
14. 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.
15. Kevin Knight. Unification: A multidisciplinary survey. ACM Computing Surveys, 21(1):93-124, 1989.
16. G.S. Makanin. The problem of solvability of equations in a free semigroup. Matematiceskif Sbornik, 103:147-236, 1977. In Russian. English translation in Math. USSR Sbornik, 32:129-198, 1977.
17. Francesco Parisi-Presicce, Hartmut Ehrig, and Ugo Montanari. Graph rewriting with unification and composition. In Proc. Graph-Grammars and Their Application to Computer Science, pages 496-514. Springer Lecture Notes in Computer Science 291, 1987.
18. M.S. Paterson and M.N. Wegman. Linear unification. Journal of Computer and System Sciences, 16:158-167, 1978.
19. Klaus U. Schulz. Word unification and transformation of generalized equations. Journal of Automated Reasoning, 11:149-184, 1993.