Decidability of graph neural networks via logical characterizations
We present results concerning the expressiveness and decidability of a popular graph learning formalism, graph neural networks (GNNs), exploiting connections with logic. We use a family of recently-discovered decidable logics involving ``Presburger quantifiers''. We show how to use the...
| প্রধান লেখক: | , , , |
|---|---|
| বিন্যাস: | Conference item |
| ভাষা: | English |
| প্রকাশিত: |
Lipics
2024
|