no code implementations • 22 Feb 2023 • Eran Rosenbluth, Jan Toenshoff, Martin Grohe
We prove that under certain restrictions, every Mean or Max GNN can be approximated by a Sum GNN, but even there, a combination of (Sum, [Mean/Max]) is more expressive than Sum alone.
1 code implementation • 11 Mar 2021 • Jan Toenshoff, Neta Friedman, Martin Grohe, Benny Kimelfeld
We study the problem of computing an embedding of the tuples of a relational database in a manner that is extensible to dynamic changes of the database.
Knowledge Graphs Databases
1 code implementation • 18 Sep 2019 • Jan Toenshoff, Martin Ritzert, Hinrikus Wolf, Martin Grohe
Many combinatorial optimization problems can be phrased in the language of constraint satisfaction problems.