Add to ORKGAbstract. Graph databases are directed graphs in which the edges are labeled with symbols from a finite alphabet. In this paper we introduce a logic for such graphs in which the domain is the set of edges. We compare its expressiveness with the standard logic in which the domain the set of vertices. Furthermore, we introduce a robust model of computation for such logic, the so called graph pebble automata.
Graphs are a popular model in mathematics, and automata, or abstract models of machines, are a usefu...
Motivated by the current interest in languages for expressing path queries to graph databases, this ...
Abstract. Combining ideas from distributed algorithms and alternating automata, we introduce a new c...
We discuss some methods for rigorous expressions of infinite labeled directed graphs. In these metho...
An edge grammar is a formal mechanism for representing families of related graphs (binary trees, hyp...
Graphs are ubiquitous in Computer Science. For this reason, in many areas, it is very important to h...
We present a form of algebraic reasoning for computational objects which are expressed as graphs. Ed...
We propose a data model and query language that integrates an explicit modeling and querying of grap...
AbstractGraph grammars can be regarded as a generalization of context-free grammars from strings to ...
AbstractGraph grammars may be used as specification technique for different kinds of systems, specia...
We present a form of algebraic reasoning for computational objects which are expressed as graphs. Ed...
A problem with current database technology is its inability to represent complex relationships in a ...
Graph data appears in a variety of application domains, and many uses of it, such as query-ing, matc...
The generic graph machine, a Turing machine-like computation model for generic graph functions, is i...
Graph grammars can be regarded as a generalization of context-free grammars from strings to graphs. ...
Graphs are a popular model in mathematics, and automata, or abstract models of machines, are a usefu...
Motivated by the current interest in languages for expressing path queries to graph databases, this ...
Abstract. Combining ideas from distributed algorithms and alternating automata, we introduce a new c...
We discuss some methods for rigorous expressions of infinite labeled directed graphs. In these metho...
An edge grammar is a formal mechanism for representing families of related graphs (binary trees, hyp...
Graphs are ubiquitous in Computer Science. For this reason, in many areas, it is very important to h...
We present a form of algebraic reasoning for computational objects which are expressed as graphs. Ed...
We propose a data model and query language that integrates an explicit modeling and querying of grap...
AbstractGraph grammars can be regarded as a generalization of context-free grammars from strings to ...
AbstractGraph grammars may be used as specification technique for different kinds of systems, specia...
We present a form of algebraic reasoning for computational objects which are expressed as graphs. Ed...
A problem with current database technology is its inability to represent complex relationships in a ...
Graph data appears in a variety of application domains, and many uses of it, such as query-ing, matc...
The generic graph machine, a Turing machine-like computation model for generic graph functions, is i...
Graph grammars can be regarded as a generalization of context-free grammars from strings to graphs. ...
Graphs are a popular model in mathematics, and automata, or abstract models of machines, are a usefu...
Motivated by the current interest in languages for expressing path queries to graph databases, this ...
Abstract. Combining ideas from distributed algorithms and alternating automata, we introduce a new c...