Graph rewriting: A bibliographical guide

被引：0
|
作者：
Courcelle, B
机构：
来源：
TERM REWRITING | 1995年 / 909卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Graph rewriting is not presently a unified theory. There are numerous notions of graph rewriting and this diversity reflects the diversity of motivations. We offer a classification of the main definitions. A selected and annotated bibliography reviews recent and accessible papers and books.
引用
收藏
页码：74 / 74
页数：1
相关论文
共 50 条
  • [1] A Bibliographical Guide
    Ottemiller, John H.
    [J]. LIBRARY JOURNAL, 1952, 77 (06) : 517 - 518
  • [2] ON THE ADEQUACY OF GRAPH REWRITING FOR STIMULATING TERM REWRITING
    KENNAWAY, JR
    KLOP, JW
    SLEEP, MR
    DEVRIES, FJ
    [J]. ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1994, 16 (03): : 493 - 523
  • [3] Term Graph Rewriting and Parallel Term Rewriting
    Corradini, Andrea
    Drewes, Frank
    [J]. ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2011, (48): : 3 - 18
  • [4] TERM GRAPH REWRITING
    BARENDREGT, HP
    VANEEKELEN, MCJD
    GLAUERT, JRW
    KENNAWAY, JR
    PLASMEIJER, MJ
    SLEEP, MR
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1987, 259 : 141 - 158
  • [5] Termination of Graph and Term Graph Rewriting
    Koenig, Barbara
    [J]. ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2016, (225): : 2 - 2
  • [6] Ambient Graph Rewriting
    Cenciarelli, Pietro
    Talamo, Ivano
    Tiberi, Alessandro
    [J]. ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2005, 117 : 335 - 351
  • [7] Patch Graph Rewriting
    Overbeek, Roy
    Endrullis, Jorg
    [J]. GRAPH TRANSFORMATION, ICGT 2020, 2020, 12150 : 128 - 145
  • [8] Term graph rewriting
    Klop, JW
    [J]. HIGHER-ORDER ALGEBRA, LOGIC, AND TERM REWRITING, 1996, 1074 : 1 - 16
  • [9] Implementing conditional term rewriting by graph rewriting
    Ohlebusch, E
    [J]. THEORETICAL COMPUTER SCIENCE, 2001, 262 (1-2) : 311 - 331
  • [10] Graph rewriting for the π-calculus
    Gadducci, Fabio
    [J]. MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE, 2007, 17 (03) : 407 - 437
12345