Results 11 to 20 of about 29,070 (246)
Graph design by graph grammar evolution [PDF]
2007 IEEE Congress on Evolutionary Computation, 2007 Determining the optimal topology of a graph is pertinent to many domains, as graphs can be used to model a variety of systems. Evolutionary algorithms constitute a popular optimization method, but scalability is a concern with larger graph designs. Generative representation schemes, often inspired by biological development, seek to address this by ...
Martin H. Luerssen, David M. W. Powers
openaire +1 more source
Parsing Graphs with Regular Graph Grammars [PDF]
Proceedings of the 6th Joint Conference on Lexical and Computational
Semantics (*SEM 2017), 2017 Recently, several datasets have become available which represent natural language phenomena as graphs. Hyperedge Replacement Languages (HRL) have been the focus of much attention as a formalism to represent the graphs in these datasets. Chiang et al.
Gilroy, Sorcha +2 more
openaire +2 more sources
Search and Result Presentation in Scientific Workflow Repositories [PDF]
, 2013 We study the problem of searching a repository of complex hierarchical workflows whose component modules, both composite and atomic, have been annotated with keywords.
Davidson, Susan B. +3 more
core +3 more sources
Graph parsing with s-graph grammars [PDF]
Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing (Volume 1: Long Papers), 2015 A key problem in semantic parsing with graph-based semantic representations is graph parsing, i.e. computing all possible analyses of a given graph according to a grammar. This problem arises in training synchronous string-to-graph grammars, and when generating strings from them. We present two algorithms for graph parsing (bottom-up and top-down) with
Jonas Groschwitz +2 more
openaire +1 more source
An abstract machine for the execution of graph grammars [PDF]
, 1994 An abstract machine for graph rewriting is the central part of the middle layer of the implementation of a grammar based graph rewriting system. It specifies the interface between a compiler for graph grammars and a system performing actual graph ...
Dörr, Heiko
core +1 more source
An 00 visual language definition approach supporting multiple views [PDF]
, 2000 The formal approach to visual language definition is to use graph grammars and/or graph transformation techniques. These techniques focus on specifying the syntax and manipulation rules of the concrete representation. This paper presents a constraint and
Akehurst, David H. +1 more
core +1 more source
Graph-Based Shape Analysis Beyond Context-Freeness
, 2018 We develop a shape analysis for reasoning about relational properties of data structures. Both the concrete and the abstract domain are represented by hypergraphs.
A Habel +14 more
core +1 more source
On external presentations of infinite graphs [PDF]
, 2009 The vertices of a finite state system are usually a subset of the natural numbers. Most algorithms relative to these systems only use this fact to select vertices. For infinite state systems, however, the situation is different: in particular, for such
Morvan, Christophe
core +6 more sources
Equational reasoning with context-free families of string diagrams
, 2015 String diagrams provide an intuitive language for expressing networks of interacting processes graphically. A discrete representation of string diagrams, called string graphs, allows for mechanised equational reasoning by double-pushout rewriting ...
A Joyal +11 more
core +1 more source
International Journal of Computer Mathematics, 2003 The notations of (1) KBO: Knowledge Based Object, (2) FTD: Formally Technology Dependent, (3) WW KBO: Window Womb KBO, (4) PL KBO: Programming Language KBO, (5) APM KBO: Abstract Processing Machine KBO, and (6) AIPM KBO: Abstract Information Processing Mechanism KBO, were studied in U¨nlu¨ [1-3]. Let the meaning of an arbitrarily chosen X :=\langle X^o,
openaire +3 more sources