GNNs preserved under embeddings, injective homomorphisms, and homomorphisms are exactly characterized by existential graded modal logic, its existential-positive fragment, and existential-positive modal logic, with matching GNN architectures existing for each.
Graded modal logic and counting bisimulation
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
roles
background 1polarities
background 1representative citing papers
Craig interpolants for hybrid modal logics are computable in 4-EXPTIME when they exist, while uniform interpolant existence is undecidable.
Logic-based Weisfeiler-Leman variants enable graph-to-table conversion for classification that matches GNN and graph transformer accuracy while running 5-20x faster without GPUs.
SAGE is a self-evolving agentic graph-memory engine that dynamically constructs and refines structured memory graphs via writer-reader feedback, yielding performance gains on multi-hop QA, open-domain retrieval, and long-term agent benchmarks.
citing papers explorer
-
Structural Preservation and the Logical Expressiveness of Graph Neural Networks
GNNs preserved under embeddings, injective homomorphisms, and homomorphisms are exactly characterized by existential graded modal logic, its existential-positive fragment, and existential-positive modal logic, with matching GNN architectures existing for each.
-
SAGE: A Self-Evolving Agentic Graph-Memory Engine for Structure-Aware Associative Memory
SAGE is a self-evolving agentic graph-memory engine that dynamically constructs and refines structured memory graphs via writer-reader feedback, yielding performance gains on multi-hop QA, open-domain retrieval, and long-term agent benchmarks.