Neuro-Relational Programs: Unifying Queries and Neural Computation over Structured Data

• URL: http://arxiv.org/abs/2606.11946v1
• Date: Wed, 10 Jun 2026 11:16:36 GMT
• Title: Neuro-Relational Programs: Unifying Queries and Neural Computation over Structured Data
• Abstract summary: We introduce Neuro-Relational Programs (NRPs), a declarative query language for relational databases.<n>NRPs extend Datalog-style rules with operations that combine, aggregate, and transform embeddings.<n>We characterize the expressive power of unrestricted NRPs with ReLU-FFN transformations by FOCQ.
• Score: 9.932884719997432
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The conventional approach to deep learning over relational databases applies neural models, such as Graph Neural Networks (GNNs), to a graph representation of the database. Recent approaches instead operate on databases directly, associating tuples with embeddings and extending query mechanisms to jointly process embeddings and relational content. Inspired by these developments, we introduce Neuro-Relational Programs (NRPs), a declarative query language for relational databases whose facts carry numeric vector embeddings. NRPs extend Datalog-style rules with operations that combine, aggregate, and transform embeddings, thereby interleaving relational reasoning and learnable neural components within a single formalism. This yields a general approach to neural computation over relational data: an NRP can be read both as a query plan with trainable components and as a neural architecture with relational structure built in. Natural syntactic fragments of NRPs recover existing architectures and query formalisms. Zero-ary NRPs correspond to non-adaptive query algorithms; monadic NRPs generalize GNN-style message passing and precisely capture Deep Homomorphism Networks, a connection that we extend to frontier-guarded NRPs over databases with row-ids. We characterize the expressive power of unrestricted NRPs with ReLU-FFN transformations by FOCQ, an extension of first-order logic with counting interpreted over real-weighted structures, yielding a precise connection with uniform TC$^0$ over ordered databases. Together, these results establish NRPs as a broad declarative framework for querying and neural computation over relational data.

Related papers

• Incorporating Deep Learning Design in Database Queries [3.967959244819106]
  We propose an approach that naturally integrates deep learning with database queries.<n>We describe RelaNN, a proof-of-concept implementation of this approach built on top of PyTorch and cuDF.
  arXiv  Detail & Related papers  (2026-05-22T20:47:07Z)
• Is Fixing Schema Graphs Necessary? Full-Resolution Graph Structure Learning for Relational Deep Learning [34.501460016762756]
  FullResolution Structure and Optimizable Graph framework for RDL formulates learning structure as learnable table role modeling problem.<n>We introduce dependency constraints that regularize functional representations across table entity levels.<n>Experiments demonstrate that our method outperforms existing approaches.
  arXiv  Detail & Related papers  (2026-05-20T17:56:09Z)
• The Human Brain as a Combinatorial Complex [3.849079578881503]
  Current graph-based representations of brain networks miss the higher-order dependencies that characterize neural complexity.<n>We propose a framework for constructing complexes (CCs) from fMRI time series data that captures both pairwise and higher-order neural interactions.<n>This work provides a framework for brain network representation that preserves fundamental higher-order structure invisible to traditional graph methods.
  arXiv  Detail & Related papers  (2025-11-22T19:04:13Z)
• Synthesize, Retrieve, and Propagate: A Unified Predictive Modeling Framework for Relational Databases [34.57267286892218]
  We propose SRP, a unified predictive modeling framework that synthesizes features using the unary dependency.<n>SRP is designed to fully capture both the unary and the composite dependencies within a relational database.
  arXiv  Detail & Related papers  (2025-08-10T07:59:41Z)
• Relational Deep Learning: Challenges, Foundations and Next-Generation Architectures [50.46688111973999]
  Graph machine learning has led to a significant increase in the capabilities of models that learn on arbitrary graph-structured data.<n>We present a new blueprint that enables end-to-end representation of'relational entity graphs' without traditional engineering feature.<n>We discuss key challenges including large-scale multi-table integration and the complexities of modeling temporal dynamics and heterogeneous data.
  arXiv  Detail & Related papers  (2025-06-19T23:51:38Z)
• RelGNN: Composite Message Passing for Relational Deep Learning [56.48834369525997]
  We introduce RelGNN, a novel GNN framework specifically designed to leverage the unique structural characteristics of the graphs built from relational databases.<n>RelGNN is evaluated on 30 diverse real-world tasks from Relbench (Fey et al., 2024), and achieves state-of-the-art performance on the vast majority tasks, with improvements of up to 25%.
  arXiv  Detail & Related papers  (2025-02-10T18:58:40Z)
• Defining Neural Network Architecture through Polytope Structures of Dataset [53.512432492636236]
  This paper defines upper and lower bounds for neural network widths, which are informed by the polytope structure of the dataset in question. We develop an algorithm to investigate a converse situation where the polytope structure of a dataset can be inferred from its corresponding trained neural networks. It is established that popular datasets such as MNIST, Fashion-MNIST, and CIFAR10 can be efficiently encapsulated using no more than two polytopes with a small number of faces.
  arXiv  Detail & Related papers  (2024-02-04T08:57:42Z)
• On The Expressivity of Recurrent Neural Cascades [48.87943990557107]
  Recurrent Neural Cascades (RNCs) are the recurrent neural networks with no cyclic dependencies among recurrent neurons. We show that RNCs can achieve the expressivity of all regular languages by introducing neurons that can implement groups.
  arXiv  Detail & Related papers  (2023-12-14T15:47:26Z)
• Logical Message Passing Networks with One-hop Inference on Atomic Formulas [57.47174363091452]
  We propose a framework for complex query answering that decomposes the Knowledge Graph embeddings from neural set operators. On top of the query graph, we propose the Logical Message Passing Neural Network (LMPNN) that connects the local one-hop inferences on atomic formulas to the global logical reasoning. Our approach yields the new state-of-the-art neural CQA model.
  arXiv  Detail & Related papers  (2023-01-21T02:34:06Z)
• Random Graph-Based Neuromorphic Learning with a Layer-Weaken Structure [4.477401614534202]
  We transform the random graph theory into an NN model with practical meaning and based on clarifying the input-output relationship of each neuron. Under the usage of this low-operation cost approach, neurons are assigned to several groups of which connection relationships can be regarded as uniform representations of random graphs they belong to. We develop a joint classification mechanism involving information interaction between multiple RGNNs and realize significant performance improvements in supervised learning for three benchmark tasks.
  arXiv  Detail & Related papers  (2021-11-17T03:37:06Z)
• Reinforced Neighborhood Selection Guided Multi-Relational Graph Neural Networks [68.9026534589483]
  RioGNN is a novel Reinforced, recursive and flexible neighborhood selection guided multi-relational Graph Neural Network architecture. RioGNN can learn more discriminative node embedding with enhanced explainability due to the recognition of individual importance of each relation.
  arXiv  Detail & Related papers  (2021-04-16T04:30:06Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.