Showing cs.LGShow all
2 papers · 1 filter
cs.LG2026
The Boolean Power of ReLU
Pablo Barceló, Floris Geerts, Matthias Lanzinger +2
We prove that, on finite simple undirected graphs equipped with a single Boolean node feature, the Boolean queries expressible in -MPLang, for any collection of eventually c…
cs.LG2025
A Logical View of GNN-Style Computation and the Role of Activation Functions
Pablo Barceló, Floris Geerts, Matthias Lanzinger +2
We study the numerical and Boolean expressiveness of MPLang, a declarative language that captures the computation of graph neural networks (GNNs) through linear message passing and…