Open Science Slovenia
New in RUL
Graph grammar induction as a parser-controlled heuristic search process
URL - Presentation file, Visit
A graph grammar is a generative description of a graph language (a possibly infinite set of graphs). In this paper, we present a novel algorithm for inducing a graph grammar from a given set of 'positive' and 'negative' graphs. The algorithm is guaranteed to produce a grammar that can generate all of the positive and none of the negative input graphs. Driven by a heuristic specific-to-general search process, the algorithm tries to find a small grammar that generalizes beyond the positive input set. During the search, the algorithm employs a graph grammar parser to eliminate the candidate grammars that can generate at least one negative input graph. We validate our method by inducing grammars for chemical structural formulas and flowcharts and thereby show its potential applicability to chemical engineering and visual programming.
indukcija grafnih gramatik
sintaksna analiza z grafnimi gramatikami
Not categorized (r6)
1.08 - Published Scientific Conference Contribution
FRI - Faculty of computer and information science
Springer-Verlag, Berlin Heidelberg
Number of pages:
ISSN on article:
Voting is allowed only to
Cite this work
Record is a part of a proceedings
Applications of graph transformations with industrial relevance
Record is a part of a journal
Lecture notes in computer science
Lect. notes comput. sci.
graph grammar induction
graph grammar parsing
Similar works from RUL:
Similar works from other Slovenian collections:
You have to
to leave a comment.
0 - 0 / 0
There are no comments!