Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

ECEASST
2008

favoriteEmaildiscussreport

87views more ECEASST 2008»

The GP Programming System

13 years 4 months ago

The GP Programming System

Download tfs.cs.tu-berlin.de

Abstract: We describe the programming system for the graph-transformation lan, focusing on the implementation of its compiler and abstract machine. We also compare the system's performance with other graph-transformation systems. The GP language is based on conditional rule schemata and comes with a simple formal semantics which maps input graphs to sets of output graphs. The implementation faithfully matches the semantics by using backtracking and allowing to compute all possible results for a given input.

Greg Manning, Detlef Plump

Real-time Traffic

Conditional Rule Schemata | ECEASST 2008 | Input Graphs | Simple Formal Semantics |

claim paper

Related Content

» Polymorphism and Genetic Programming

» Robotic Control Using Hierarchical Genetic Programming

» Unsupervised Problem Decomposition Using Genetic Programming

» Program Evolution by Integrating EDP and GP

» Memory with memory soft assignment in genetic programming

» Genetic programming for finite algebras

» Algebraic simplification of GP programs during evolution

» Online modelling based on Genetic Programming

» Improving the Generalisation Ability of Genetic Programming with Semantic Similarity based...

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	ECEASST
Authors	Greg Manning, Detlef Plump

Comments (0)