Paper · arXiv
On Counting Graphs for Modal Logic with Counting
In this paper, we study the theoretical computational complexity of counting trees and graphs that are classified positively by a graph neural networks, or said equivalently that satisfy a given formula of modal logic with counting. We also study convergence.
| Authors | Avijeet Ghosh, François Schwarzentruber |
|---|---|
| Primary category | cs.AI |
| Published | 19 October 2026 |
| Last updated at source | 19 October 2026 |
Popularity, last 2 days
0 now. Counts as reported by the source, snapshotted daily by Silytics.
Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 21 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.