Neural Proposals, Symbolic Guarantees: Neuro-Symbolic Graph Generation with Hard Constraints

• URL: http://arxiv.org/abs/2602.16954v2
• Date: Tue, 24 Feb 2026 15:41:02 GMT
• Title: Neural Proposals, Symbolic Guarantees: Neuro-Symbolic Graph Generation with Hard Constraints
• Authors: Chuqin Geng, Li Zhang, Mark Zhang, Haolin Ye, Ziyu Zhao, Xujie Si,
• Abstract summary: We introduce Neuro-Symbolic Graph Generative Modeling (NSGGM), a neurosymbolic framework that reapproaches molecule generation as a scaffold and interaction learning task with symbolic assembly.<n>An autoregressive neural model proposes scaffolds and refines interaction signals, and a CPU-efficient SMT solver constructs full graphs while enforcing chemical validity, structural rules, and user-specific constraints.<n>NSGGM delivers strong performance on both unconstrained generation and constrained generation tasks, demonstrating that neuro-symbolic modeling can match state-of-the-art generative performance while offering explicit controllability and guarantees.
• Score: 11.61618152472216
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We challenge black-box purely deep neural approaches for molecules and graph generation, which are limited in controllability and lack formal guarantees. We introduce Neuro-Symbolic Graph Generative Modeling (NSGGM), a neurosymbolic framework that reapproaches molecule generation as a scaffold and interaction learning task with symbolic assembly. An autoregressive neural model proposes scaffolds and refines interaction signals, and a CPU-efficient SMT solver constructs full graphs while enforcing chemical validity, structural rules, and user-specific constraints, yielding molecules that are correct by construction and interpretable control that pure neural methods cannot provide. NSGGM delivers strong performance on both unconstrained generation and constrained generation tasks, demonstrating that neuro-symbolic modeling can match state-of-the-art generative performance while offering explicit controllability and guarantees. To evaluate more nuanced controllability, we also introduce a Logical-Constraint Molecular Benchmark, designed to test strict hard-rule satisfaction in workflows that require explicit, interpretable specifications together with verifiable compliance.

Related papers

• Protect$^*$: Steerable Retrosynthesis through Neuro-Symbolic State Encoding [0.0]
  We introduce Protect$*$, a neuro-symbolic framework that grounds the generative capabilities of Large Language Models (LLMs) in rigorous chemical logic.<n>Our approach combines automated rule-based reasoning and the generative of neural models.<n>We demonstrate this neuro-symbolic approach through case studies on complex natural products, including the discovery of a novel synthetic pathway for Erythromycin B.
  arXiv  Detail & Related papers  (2026-02-13T19:41:55Z)
• Composable Score-based Graph Diffusion Model for Multi-Conditional Molecular Generation [85.58520120011269]
  We propose Composable Score-based Graph Diffusion model (CSGD), which extends score matching to discrete graphs via concrete scores.<n>We show that CSGD achieves state-of-the-art performance with a 15.3% average improvement in controllability over prior methods.<n>Our findings highlight the practical advantages of score-based modeling for discrete graph generation and its capacity for flexible, multi-property molecular design.
  arXiv  Detail & Related papers  (2025-09-11T13:37:56Z)
• Combining Graph Neural Networks and Mixed Integer Linear Programming for Molecular Inference under the Two-Layered Model [6.107266553770076]
  We develop a molecular inference framework based on mol-infer, namely mol-infer-GNN, that utilizes GNN as the learning method.<n>Our proposed GNN model can obtain satisfying learning performances for some properties despite its simple structure.
  arXiv  Detail & Related papers  (2025-07-05T06:57:37Z)
• Neuro-Symbolic Generative Diffusion Models for Physically Grounded, Robust, and Safe Generation [44.80048928651511]
  Neuro-Symbolic Diffusion (NSD) is a novel framework that interleaves diffusion steps with symbolic optimization.<n>This paper introduces NSD, enabling the generation of certifiably consistent samples under user-defined functional and logic constraints.<n>This ability is demonstrated on tasks spanning three key challenges: (1) Safety, in the context of non-toxic molecular generation and collision-free trajectory optimization; (2) Data scarcity, in domains such as drug discovery and materials engineering; and (3) Out-of-domain generalization.
  arXiv  Detail & Related papers  (2025-06-01T18:58:59Z)
• GENERator: A Long-Context Generative Genomic Foundation Model [66.46537421135996]
  We present GENERator, a generative genomic foundation model featuring a context length of 98k base pairs (bp) and 1.2B parameters.<n>Trained on an expansive dataset comprising 386B bp of DNA, the GENERator demonstrates state-of-the-art performance across both established and newly proposed benchmarks.<n>It also shows significant promise in sequence optimization, particularly through the prompt-responsive generation of enhancer sequences with specific activity profiles.
  arXiv  Detail & Related papers  (2025-02-11T05:39:49Z)
• Relational Neurosymbolic Markov Models [13.22004615196798]
  Sequential problems are ubiquitous in AI, such as in reinforcement learning or natural language processing.<n>We introduce neurosymbolic AI (NeSy) which provides a sound formalism to enforce constraints in deep probabilistic models but scales exponentially on sequential problems.<n>We propose a strategy for inference and learning that scales on sequential settings, and that combines approximate Bayesian inference, automated reasoning, and gradient estimation.
  arXiv  Detail & Related papers  (2024-12-17T15:41:51Z)
• On the Trade-off Between Efficiency and Precision of Neural Abstraction [62.046646433536104]
  Neural abstractions have been recently introduced as formal approximations of complex, nonlinear dynamical models. We employ formal inductive synthesis procedures to generate neural abstractions that result in dynamical models with these semantics.
  arXiv  Detail & Related papers  (2023-07-28T13:22:32Z)
• Gibbs-Duhem-Informed Neural Networks for Binary Activity Coefficient Prediction [45.84205238554709]
  We propose Gibbs-Duhem-informed neural networks for the prediction of binary activity coefficients at varying compositions. We include the Gibbs-Duhem equation explicitly in the loss function for training neural networks.
  arXiv  Detail & Related papers  (2023-05-31T07:36:45Z)
• Graph neural networks for the prediction of molecular structure-property relationships [59.11160990637615]
  Graph neural networks (GNNs) are a novel machine learning method that directly work on the molecular graph. GNNs allow to learn properties in an end-to-end fashion, thereby avoiding the need for informative descriptors. We describe the fundamentals of GNNs and demonstrate the application of GNNs via two examples for molecular property prediction.
  arXiv  Detail & Related papers  (2022-07-25T11:30:44Z)
• EINNs: Epidemiologically-Informed Neural Networks [75.34199997857341]
  We introduce a new class of physics-informed neural networks-EINN-crafted for epidemic forecasting. We investigate how to leverage both the theoretical flexibility provided by mechanistic models as well as the data-driven expressability afforded by AI models.
  arXiv  Detail & Related papers  (2022-02-21T18:59:03Z)
• NeuroLogic A*esque Decoding: Constrained Text Generation with Lookahead Heuristics [73.96837492216204]
  We propose NeuroLogic A*esque, a decoding algorithm that incorporates estimates of future cost. We develop efficient lookaheads that are efficient for large-scale language models. Our approach achieves competitive baselines on five generation tasks, and new state-of-the-art performance on table-to-text generation, constrained machine translation, and keyword-constrained generation.
  arXiv  Detail & Related papers  (2021-12-16T09:22:54Z)
• Quantitative Evaluation of Explainable Graph Neural Networks for Molecular Property Prediction [2.8544822698499255]
  Graph neural networks (GNNs) remain of limited acceptance in drug discovery due to their lack of interpretability. In this work, we build three levels of benchmark datasets to quantitatively assess the interpretability of the state-of-the-art GNN models. We implement recent XAI methods in combination with different GNN algorithms to highlight the benefits, limitations, and future opportunities for drug discovery.
  arXiv  Detail & Related papers  (2021-07-01T04:49:29Z)

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.