We introduce a weighted extension of the recently proposed notion of order-preserving hyperedge-replacement grammars and prove that the weight of a graph according to such a weighted graph grammar can be computed uniformly in quadratic time (under assumptions made precise in the paper)
This paper is intended as a step towards a theoretically sound approach to learning from graphs, by ...
This thesis presents work done on compressed graph representations via hyperedge replacement gramma...
With the abundance of large sets of relational data, methods for analyzing and providing a compact r...
We introduce a weighted extension of the recently proposed notion of order-preserving hyperedge-repl...
It is well known that hyperedge-replacement grammars can generate NP-complete graph languages even u...
Hyperedge replacement grammar (HRG) is a formalism for generating and transforming graphs that has p...
The field of semantic modelling concerns formal models for semantics, that is, formal structures for...
Abstract: Hyperedge-replacement grammars and separation-logic formulas both define classes of graph-...
Graph parsing is known to be computationally expensive. For this reason the construction of special-...
AbstractConsider a class C of hyperedge-replacement graph grammars and a numeric function on graphs ...
AbstractIn the theory of hyperedge-replacement grammars and languages, one encounters three types of...
A key problem in semantic parsing with graph-based semantic representations is graph parsing, i.e. c...
AbstractWe introduce the handle-rewriting hypergraph grammars (HH grammars), based on the replacemen...
AbstractThis study is based on the halting and complexity problems for a simple class of logic progr...
This paper is intended as a step towards a theoretically sound approach to learning from graphs, by ...
This thesis presents work done on compressed graph representations via hyperedge replacement gramma...
With the abundance of large sets of relational data, methods for analyzing and providing a compact r...
We introduce a weighted extension of the recently proposed notion of order-preserving hyperedge-repl...
It is well known that hyperedge-replacement grammars can generate NP-complete graph languages even u...
Hyperedge replacement grammar (HRG) is a formalism for generating and transforming graphs that has p...
The field of semantic modelling concerns formal models for semantics, that is, formal structures for...
Abstract: Hyperedge-replacement grammars and separation-logic formulas both define classes of graph-...
Graph parsing is known to be computationally expensive. For this reason the construction of special-...
AbstractConsider a class C of hyperedge-replacement graph grammars and a numeric function on graphs ...
AbstractIn the theory of hyperedge-replacement grammars and languages, one encounters three types of...
A key problem in semantic parsing with graph-based semantic representations is graph parsing, i.e. c...
AbstractWe introduce the handle-rewriting hypergraph grammars (HH grammars), based on the replacemen...
AbstractThis study is based on the halting and complexity problems for a simple class of logic progr...
This paper is intended as a step towards a theoretically sound approach to learning from graphs, by ...
This thesis presents work done on compressed graph representations via hyperedge replacement gramma...
With the abundance of large sets of relational data, methods for analyzing and providing a compact r...