Results 31 to 40 of about 2,840 (305)

A Demonstration of the Grrr Graph Rewriting Programming Language [PDF]

open access: yes, 2000
This paper overviews the graph rewriting programming language, Grrr. The serial graph rewriting strategy is detailed, and key elements of the user interface are described.
Rodgers, Peter, Vidal, Natalia
core   +1 more source

Context-free path querying with all-path semantics using matrices with sets of intermediate vertices [PDF]

open access: yesНаучно-технический вестник информационных технологий, механики и оптики, 2021
The study considers the problem of context-free path querying with all-path query semantics. This problem consists in finding all paths of the graph, the labels on the edges of which form words from the language generated by the input context-free ...
Rustam Sh. Azimov, Semyon V. Grigorev
doaj   +1 more source

Graph design by graph grammar evolution [PDF]

open access: yes2007 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

Hypergrammar Based Parallel Multi-Frontal Solver For Grids With Point Singularities

open access: yesComputer Science, 2015
This paper describes the application of hypergraph grammars to drive linear computationalcost solver for grids with point singularities. Such graph grammar productions are the rstmathematical formalism used to describe solver algorithm and each of them ...
Piotr Gurgul   +2 more
doaj   +1 more source

A Graph Rewriting Visual Language for Database Programming [PDF]

open access: yes, 1997
Textual database programming languages are computationally complete, but have the disadvantage of giving the user a non-intuitive view of the database information that is being manipulated.
Rodgers, Peter   +3 more
core   +1 more source

Navigating the Chemical Space of HCN Polymerization and Hydrolysis: Guiding Graph Grammars by Mass Spectrometry Data

open access: yesEntropy, 2013
Polymers of hydrogen cyanide and their hydrolysis products constitute a plausible, but still poorly understood proposal for early prebiotic chemistry on Earth.
Peter F. Stadler   +5 more
doaj   +1 more source

Parsing Graphs with Regular Graph Grammars [PDF]

open access: yesProceedings 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

An Event Structure Semantics for Graph Grammars with Parallel Productions [PDF]

open access: yes, 1996
We propose a truly concurrent semantics for graph grammars, based on event structures, that generalizes to arbitrary consuming grammars (i.e., such that each production deletes some items) the semantics presented in [4] for the subclass of safe grammars.
MONTANARI, UGO GIOVANNI ERASMO   +4 more
core   +1 more source

FAIR and Interactive Data Graphics from a Scientific Knowledge Graph

open access: yesScientific Data, 2022
Graph databases capture richly linked domain knowledge by integrating heterogeneous data and metadata into a unified representation. Here, we present the use of bespoke, interactive data graphics (bar charts, scatter plots, etc.) for visual exploration ...
Michael E. Deagen   +6 more
doaj   +1 more source

Graph parsing with s-graph grammars [PDF]

open access: yesProceedings 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

Home - About - Disclaimer - Privacy