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 $\Sigma$-MPLang, for any collection $\Sigma$ of eventually c…