
The Logic of Graph Neural Networks
Graph neural networks (GNNs) are deep learning architectures for machine...
read it

Dynamic Database Embeddings with FoRWaRD
We study the problem of computing an embedding of the tuples of a relati...
read it

On the Parameterized Complexity of Learning Logic
We analyse the complexity of learning firstorder definable concepts in ...
read it

Graph Learning with 1D Convolutions on Random Walks
We propose CRaWl (CNNs for Random Walks), a novel neural network archite...
read it

Probabilistic Data with Continuous Distributions
Statistical models of real world data typically involve continuous proba...
read it

Automorphism groups of graphs of bounded Hadwiger number
We determine the structure of automorphism groups of finite graphs of bo...
read it

Standard Probabilistic Databases
Probabilistic databases (PDBs) model uncertainty in data in a quantitati...
read it

Recent Advances on the Graph Isomorphism Problem
We give an overview of recent advances on the graph isomorphism problem....
read it

Independence in Infinite Probabilistic Databases
Probabilistic databases (PDBs) model uncertainty in data. The current st...
read it

The Surprising Power of Graph Neural Networks with Random Node Initialization
Graph neural networks (GNNs) are effective models for representation lea...
read it

Database Repairing with Soft Functional Dependencies
A common interpretation of soft constraints penalizes the database for e...
read it

TupleIndependent Representations of Infinite Probabilistic Databases
Probabilistic databases (PDBs) are probability spaces over database inst...
read it

The Effects of Randomness on the Stability of Node Embeddings
We systematically evaluate the (in)stability of stateoftheart node e...
read it

Isomorphism Testing for Graphs Excluding Small Minors
We prove that there is a graph isomorphism test running in time n^polylo...
read it

word2vec, node2vec, graph2vec, X2vec: Towards a Theory of Vector Embeddings of Structured Data
Vector representations of graphs and relational structures, whether hand...
read it

Deep Weisfeiler Leman
We introduce the framework of Deep Weisfeiler Leman algorithms (DeepWL),...
read it

Counting Bounded Tree Depth Homomorphisms
We prove that graphs G, G' satisfy the same sentences of firstorder log...
read it

Generative Datalog with Continuous Distributions
Arguing for the need to combine declarative and probabilistic programmin...
read it

RUNCSP: Unsupervised Learning of Message Passing Networks for Binary Constraint Satisfaction Problems
Constraint satisfaction problems form an important and wide class of com...
read it

A Linear Upper Bound on the WeisfeilerLeman Dimension of Graphs of Bounded Genus
The WeisfeilerLeman (WL) dimension of a graph is a measure for the inhe...
read it

Infinite Probabilistic Databases
Probabilistic databases (PDBs) are used to model uncertainty in data in ...
read it

Canonisation and Definability for Graphs of Bounded Rank Width
We prove that the combinatorial WeisfeilerLeman algorithm of dimension ...
read it

Weisfeiler and Leman Go Neural: Higherorder Graph Neural Networks
In recent years, graph neural networks (GNNs) have emerged as a powerful...
read it

Probabilistic Databases with an Infinite OpenWorld Assumption
Probabilistic databases (PDBs) introduce uncertainty into relational dat...
read it

An improved isomorphism test for boundedtreewidth graphs
We give a new fpt algorithm testing isomorphism of nvertex graphs of tr...
read it

Definable decompositions for graphs of bounded linear cliquewidth
We prove that for every positive integer k, there exists an MSO_1transd...
read it

A FiniteModelTheoretic View on Propositional Proof Complexity
We establish new, and surprisingly tight, connections between propositio...
read it

WeisfeilerLeman meets Homomorphisms
In this paper, we relate a beautiful theory by Lovász with a popular heu...
read it

Graph Similarity and Approximate Isomorphism
The graph similarity problem, also known as approximate graph isomorphis...
read it

A Faster Isomorphism Test for Graphs of Small Degree
Luks's algorithm (JCSS 1982) to test isomorphism of bounded degree graph...
read it

Towards faster isomorphism tests for boundeddegree graphs
Luks' algorithm (JCSS 1982) to test isomorphism of bounded degree graphs...
read it

Constraint Solving via Fractional Edge Covers
Many important combinatorial problems can be modeled as constraint satis...
read it

Size bounds and query plans for relational joins
Relational joins are at the core of relational algebra, which in turn is...
read it

FirstOrder Query Evaluation with Cardinality Conditions
We study an extension of firstorder logic that allows to express cardin...
read it
Martin Grohe
is this you? claim profile