About: Graph rewriting

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Graph rewriting Goto Sponge NotDistinct Permalink

An Entity of Type : yago:WikicatFormalLanguages, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon

http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FGraph_rewriting&invfp=IFP_OFF&sas=SAME_AS_OFF

In computer science, graph transformation, or graph rewriting, concerns the technique of creating a new graph out of an original graph algorithmically. It has numerous applications, ranging from software engineering (software construction and also software verification) to layout algorithms and picture generation.

Attributes	Values
rdf:type	yago:Abstraction100002137 yago:Communication100033020 yago:Language106282651 yago:WikicatFormalLanguages
rdfs:label	Graph rewriting (en) Reescriptura de grafs (ca) Graphersetzungssystem (de) Reescritura de grafos (es) Reescrita de grafos (pt) Переписывание графов (ru)
rdfs:comment	Una transformació de grafs, o reescriptura de grafs, és una tècnica per crear algorístmicament un nou graf a partir d'un altre graf donat. Té nombroses aplicacions, des de l'enginyeria de programari fins a algorismes i generació d'imatges. (ca) Graphersetzungssysteme dienen der formalen Beschreibung der Veränderung von Graphen. Sie werden häufig mit Computerprogrammen implementiert und damit ausführ- und anwendbar gemacht. Ein Graphersetzungssystem ist eine Menge von Graphersetzungsregeln . Eine Graphersetzungsregel besteht aus dem Mustergraphen der linken Seite sowie dem Ersetzungsgraphen der rechten Seite. Graphersetzungssysteme können (auch) als eine Verallgemeinerung der Termersetzungssysteme von (Grund-)Termen / deren Bäumen auf Graphen angesehen werden. (de) In computer science, graph transformation, or graph rewriting, concerns the technique of creating a new graph out of an original graph algorithmically. It has numerous applications, ranging from software engineering (software construction and also software verification) to layout algorithms and picture generation. (en) En ciencias de la computación, transformación de grafos, o reescritura de grafos, Se refiere a la técnica de crear nuevos grafos a partir de un grafo origina de forma algorítmica. Tiene numerosas aplicaciones, desde ingeniería de software, ( y también Verificación de software) hasta diseño de algoritmos y generación de imágenes. (es) В информатике переписывание графов (также перезапись графов, преобразование графов, трансформация графов) — техника по созданию нового графа изисходного графа алгоритмическим образом.Переписывание графов находит широкое применение в компьютерных науках, например, в конструировании программного обеспечения, в , в генерировании изображений, в компиляторах, в графовых базах данных. (ru) Na Teoria dos Grafos, reescrita de grafos denota um sistema de reescrita para grafos, isto é, um conjunto de regras de reescrita de grafos da forma , sendo o grafo usado como padrão (no lado esquerdo) e o grafo de substituição (no lado direito da regra). Uma regra de reescrita de grafos é aplicada ao grafo hospedeiro procurando por uma ocorrência do grafo padrão (resolvendo assim o problema do isomorfismo de subgrafos) e substituindo a ocorrência encontrada por uma instância do grafo de substituição. (pt)
foaf:depiction
dcterms:subject	Graph rewriting
Wikipage page ID	1252846 (xsd:integer)
Wikipage revision ID	1077289437 (xsd:integer)
Link from a Wikipage to another Wikipage	Up to isomorphism Dependency grammar Double pushout graph rewriting Critical pair (logic) Rewriting GrGen Graph (discrete mathematics) Graph homomorphism Model checking Morphism Operational semantics Link grammar Logic Story-driven modeling Computer science Clean programming language Software engineering C++ C Sharp (programming language) Database theory GReAT Linear graph grammar Graph Database Eclipse Modeling Framework Formal verification Formal grammar Formal language Graph matching Graph theory Haskell Attributed graph grammar Graph rewriting Java (programming language) Hypergraph Model transformation VIATRA Software construction Integrated development environment OpenCog Automated verification Category theory XML Model-driven architecture Pattern matching Shape grammar Subgraph isomorphism problem Pushout (category theory) Single pushout graph rewriting Injective Term graph Double-pushout approach Abstract rewriting Labeled graph Labeled multigraph Single-pushout approach VDM Verlag Interaction net Layout algorithm dbr:Port_graph_grammar
Link from a Wikipage to an external page	http://www.elsevier.com/locate/entcs http://www.informatik.uni-trier.de/~ley/db/conf/gg/handbook1997.html http://emoflon.org/ http://groove.cs.utwente.nl/ http://tinkerpop.apache.org/gremlin.html http://wiki.opencog.org/w/RelEx http://www.fmi.uni-stuttgart.de/szs/publications/koenigba/habilschrift.pdf http://www.fujaba.de/ http://www.se.rwth-aachen.de/tikiwiki/tiki-index.php%3Fpage=Research%3A+Progres.html https://uoycs-plasma.github.io/GP2/ https://archive.today/20150317152250/https:/www.soley-technology.com/en/pr-soley-studio https://web.archive.org/web/20110217171142/http:/user.cs.tu-berlin.de/~gragra/agg/ https://www.worldscientific.com/worldscibooks/10.1142/3303 https://www.worldscientific.com/worldscibooks/10.1142/4180 https://www.worldscientific.com/worldscibooks/10.1142/4181 http://opus.kobv.de/btu/volltexte/2009/593/pdf/thesis.pdf https://www.eclipse.org/henshin/ http://homepages.laas.fr/khalil/GMTE/ http://www.emorf.org http://www.graphsynth.com

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 56 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software