Year: 2023
Type: preprint
Abstract: In this paper, we propose a modal logic in which counting modalities appear in linear inequalities. We show that each formula can be transformed into an equivalent graph neural network (GNN). We also show that each GNN can be transformed into a formula. We show that the satisfiability problem is decidable. We also discuss some variants that are in PSPACE.
Source: arXiv (Cornell University)
Authors: Nunn, Pierre, Schwarzentruber, François
Institution: Université de Rennes
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W4384112099