宣誓书
发表于 2025-3-23 13:26:07
https://doi.org/10.1007/978-3-642-96204-2It is shown that a restricted form of graph unification corresponds to solving linear Diophantine equations, and hence is decidable. For graph matching, transformation rules are given which compute all (pure) solutions to a matching problem. The matching concept suggests a new graph rewriting approa
最低点
发表于 2025-3-23 14:09:06
http://reply.papertrans.cn/39/3880/387927/387927_12.png
没血色
发表于 2025-3-23 19:51:18
http://reply.papertrans.cn/39/3880/387927/387927_13.png
发电机
发表于 2025-3-23 22:26:50
https://doi.org/10.1007/978-3-662-00449-4ata structures. Unfortunately, pure rule-based approaches are not well prepared for expressing any kind of procedural knowledge. Therefore, various extensions were proposed which regulate the application of rewrite rales. This paper compares already existing regulation mechanisms and proposes a new
Needlework
发表于 2025-3-24 04:04:02
https://doi.org/10.1007/978-3-642-68747-1cal point of view. The basic idea is to reuse concepts, which are known within or without the graph grammar field, to structure large specifications. These are the concept of distributed graph transformation systems, the concept of inheritance of specifications, and the import-export-interface conce
防水
发表于 2025-3-24 09:11:04
https://doi.org/10.1007/978-3-662-00644-3environments. Gragras are used as an operational specification method for formally describing the effect of tools on internal configurations of such an environment. We propose anew approach for decomposing large unstructured gragra specifications into coupled modules (subspecifications), sketch how
平淡而无味
发表于 2025-3-24 12:49:24
https://doi.org/10.1007/978-3-642-49838-1gnition is a powerful technique for efficiently reconstructing useful design information from existing software. We use a flow graph formalism, which is closely related to hypergraph formalisms, to represent programs and clichés and we use attributed flow graph parsing to automate recognition. The f
CLAY
发表于 2025-3-24 17:36:37
https://doi.org/10.1007/978-3-662-08743-5ssors to take their place. Reconfiguration Graph Grammar (RGG) is introduced as a model supporting the design and analysis of these reconfiguration algorithms. A formal description is given, as well as several theorems, with proofs, concerning the properties of RGG that make it well suited for model
发怨言
发表于 2025-3-24 19:10:17
Peter Uwe Witte,Heinrich Matthaeiinto edge-replacement algebras is investigated. Compositions of top-down and bottom-up tree transducers are too weak if the operations in the target algebra are powerful enough to define all series-parallel graphs, 2-trees, or related types of graphs. Tgt transducers are shown to be more powerful. T
翻布寻找
发表于 2025-3-25 00:39:32
http://reply.papertrans.cn/39/3880/387927/387927_20.png