基于极化克隆的图重写
Graph rewriting with polarized cloning
摘要：
我们处理的问题，图转换，特别注重节点克隆。我们提出了一种新的方法，图重写节点可以克隆零，一次或多次。节点可以与其所有关联边、仅与其传出边、仅与其传入边或不与其关联边一起克隆。因此，我们继承了以前的工作，如倍半推出，异构推出和自适应星文法的方法。重写规则被定义为一个跨度，其中右手边和左手边是图，而界面是极化图。一个极化图是在节点上赋予某些注释的图。克隆节点的方式由其极化注释指示。我们使用这些注释设计图转换与极化克隆。我们展示了如何克隆一个节点可以建立根据不同的可能的极化，并定义一个重写步骤作为一个最后的回调补充，然后推出。这被称为极化倍半推出方法。我们还提供了一个算法演示所提出的图变换与极化克隆。
英文摘要：
We tackle the problem of graph transformation with a particular focus on node cloning. We propose a new approach to graph rewriting where nodes can be cloned zero, one or more times. A node can be cloned together with all its incident edges, with only its outgoing edges, with only its incoming edges or with none of its incident edges. We thus subsume previous works such as the sesqui-pushout, the heterogeneous pushout and the adaptive star grammars approaches. A rewrite rule is defined as a span where the right-hand and left-hand sides are graphs while the interface is a polarized graph. A polarized graph is a graph endowed with some annotations on nodes. The way a node is cloned is indicated by its polarization annotation. We use these annotations for designing graph transformation with polarized cloning. We show how a clone of a node can be built according to the different possible polarizations and define a rewrite step as a final pullback complement followed by a pushout. This is called the polarized sesqui-pushout approach. We also provide an algorithmic presentation of the proposed graph transformation with polarized cloning.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
