5 research outputs found
When Can Matrix Query Languages Discern Matrices?
We investigate when two graphs, represented by their adjacency matrices, can be distinguished by means of sentences formed in MATLANG, a matrix query language which supports a number of elementary linear algebra operators. When undirected graphs are concerned, and hence the adjacency matrices are real and symmetric, precise characterisations are in place when two graphs (i.e., their adjacency matrices) can be distinguished. Turning to directed graphs, one has to deal with asymmetric adjacency matrices. This complicates matters. Indeed, it requires to understand the more general problem of when two arbitrary matrices can be distinguished in MATLANG. We provide characterisations of the distinguishing power of MATLANG on real and complex matrices, and on adjacency matrices of directed graphs in particular. The proof techniques are a combination of insights from the symmetric matrix case and results from linear algebra and linear control theory
Capturing the polynomial hierarchy by second-order revised Krom logic
We study the expressive power and complexity of second-order revised Krom
logic (SO-KROM). On ordered finite structures, we show that its
existential fragment -KROM equals -KROM, and
captures NL. On all finite structures, for , we show that
equals -KROM if is even, and
equals -KROM if is odd. The result gives an alternative
logic to capture the polynomial hierarchy. We also introduce an extended
version of second-order Krom logic (SO-EKROM). On ordered finite structures, we
prove that SO-EKROM collapses to -EKROM and equals . Both
of SO-EKROM and -EKROM capture co-NP on ordered finite structures
On the Expressive Power of Query Languages for Matrices
We investigate the expressive power of MATLANG, a formal language for matrix manipulation based on common matrix operations and linear algebra. The language can be extended with the operation inv of inverting a matrix. In MATLANG + inv we can compute the transitive closure of directed graphs, whereas we show that this is not possible without inversion. Indeed we show that the basic language can be simulated in the relational algebra with arithmetic operations, grouping, and summation. We also consider an operation eigen for diagonalizing a matrix, which is defined so that different eigenvectors returned for a same eigenvalue are orthogonal. We show that inv can be expressed in MATLANG + eigen. We put forward the open question whether there are boolean queries about matrices, or generic queries about graphs, expressible in MATLANG + eigen but not in MATLANG + inv. The evaluation problem for MATLANG + eigen is shown to be complete for the complexity class Exists R
On the Expressive Power of Linear Algebra on Graphs
Most graph query languages are rooted in logic. By contrast, in this paper we consider graph query languages rooted in linear algebra. More specifically, we consider MATLANG, a matrix query language recently introduced, in which some basic linear algebra functionality is supported. We investigate the problem of characterising equivalence of graphs, represented by their adjacency matrices, for various fragments of MATLANG. A complete picture is painted of the impact of the linear algebra operations in MATLANG on their ability to distinguish graphs
Capturing the polynomial hierarchy by second-order revised Krom logic
We study the expressive power and complexity of second-order revised Krom
logic (SO-KROM). On ordered finite structures, we show that its
existential fragment -KROM equals -KROM, and
captures NL. On all finite structures, for , we show that
equals -KROM if is even, and
equals -KROM if is odd. The result gives an alternative
logic to capture the polynomial hierarchy. We also introduce an extended
version of second-order Krom logic (SO-EKROM). On ordered finite structures, we
prove that SO-EKROM collapses to -EKROM and equals . Both
SO-EKROM and -EKROM capture co-NP on ordered finite structures