News

Przemek Wałęga: The Logical Expressiveness of Temporal Graph Neural Networks

Centre for Fundamentals of AI and Computational Theory 

18 September 2025

Przemek Wałęga presented a paper at the Thirty-Ninth Annual Conference on Neural Information Processing Systems, 2025 in San Diego. It is one of the top three conferences on Machine Learning.

Title:

The Logical Expressiveness of Temporal GNNs via Two-Dimensional Product Logics,

Abstract
In recent years, the expressive power of various neural architectures---including graph neural networks (GNNs), transformers, and recurrent neural networks---has been characterised using tools from logic and formal language theory. As the capabilities of basic architectures are becoming well understood, increasing attention is turning to models that combine multiple architectural paradigms. Among them particularly important, and challenging to analyse, are temporal extensions of GNNs, which integrate both spatial (graph-structure) and temporal (evolution over time) dimensions. In this paper, we initiate the study of logical characterisation of temporal GNNs by connecting them to two-dimensional product logics. We show that the expressive power of temporal GNNs depends on how graph and temporal components are combined. In particular, temporal GNNs that apply static GNNs recursively over time can capture all properties definable in the product logic of (past) propositional temporal logic PTL and the modal logic K. In contrast, architectures such as graph-and-time TGNNs and global TGNNs can only express restricted fragments of this logic, where the interaction between temporal and spatial operators is syntactically constrained. These provide us with the first results on the logical expressiveness of temporal GNNs.


Reference:
M. Sälzer, P. A. Wałęga, M. Lange, The Logical Expressiveness of Temporal GNNs via Two-Dimensional Product Logics, NeurIPS, 2025
openreview.net/forum?id=v13yQBxhut&referrer=%5Bthe%20prof...

People: Przemysław (Przemek) WAłęGA

Contact: Przemyslaw Wałęga
Email: p.walega@qmul.ac.uk

Updated by: Paul Curzon