Aug 2026· Proceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2· 0 citations· 18 references
TL;DR
RGRS is proposed, a unified neuro-symbolic framework that integrates rule-level reasoning with graph representation learning for scalable Horn rule instantiation and achieves consistently high accuracy with significant efficiency gains over symbolic and neuro-symbolic baselines.
Abstract
Knowledge graph reasoning is a fundamental problem in artificial intelligence, where rule-based methods provide strong interpretability but suffer from exponential symbolic search complexity, while existing neuro-symbolic approaches struggle to model complex Horn rules with rich topologies. We propose Rule–Graph Joint Representation Learning (RGRS), a unified neuro-symbolic framework that integrates rule-level reasoning with graph representation learning for scalable Horn rule instantiation. RGRS introduces logically constrained rule embeddings and dominance-aware subgraph representations, enabling embedding-guided structural pruning while preserving correctness through exact symbolic verification. By coupling continuous structural abstraction with deterministic matching in a filter–verify pipeline, RGRS effectively reduces the combinatorial search space without compromising logical semantics. Extensive experiments on large-scale knowledge graphs show that RGRS achieves consistently high accuracy with significant efficiency gains over symbolic and neuro-symbolic baselines, providing a principled bridge between symbolic reasoning and embedding-based efficiency.
A Neuro-Symbolic architecture that integrates a Logical Knowledge Graph (LKG) with dynamic solver routing, and introduces an ontology-based LKG that treats logical rules and constraints as first-class topological nodes, enabling explicit modeling of dependencies extracted from text.
Hai-Zhao Fan, Yu-Chi Xiong, Jize Wang et al.· 0 citations
Evaluated across nine SMT logics, SMT-Select consistently outperforms existing selectors and SMT-COMP winning solvers and closes at least 30% of the performance gap between the competition winner and the virtual best solver (VBS).
Zhengyang Lu, Paul Sarnighausen-Cahn, Jiahao Chen et al.· International Conference on...· 0 citations
Grounded Reasoning in Dependency (GRiD) is introduced, a novel dependency-aware reasoning framework that explicitly grounds reasoning steps in structured knowledge that substantially improves reasoning accuracy, consistency, and faithfulness compared to recent state-of-the-art structured reasoning methods.
Xiangyu Wen, Min Li, Junhua Huang et al.· Neural Information Processin...· 2 citations
A unified framework that embeds unstructured text into structured knowledge graphs, creating a heterogeneous network for flexible evidence retrieval, outperforming SOTA baselines in answer accuracy and reasoning fidelity while maintaining extremely low token costs and near real-time inference is proposed.
In machine reading comprehension (MRC) tasks that involve complex logical reasoning, graph structures are often regarded as a more suitable representation paradigm than plain text sequences, owing to their explicit structured semantic environment and strong relational inference capabilities. Nevertheless, most existing...
Zhuo Zhao, Zhiwen Xie, Guang-You Zhou et al.· IEEE Transactions on Audio,...· 0 citations
A Structure-Internalized Rule Language Model (SIRLM) is proposed, which centers on structural rule generation to couple the parametric learning of structural knowledge with the faithfulness evaluation of reasoning logic, enabling LLMs to anchor tightly to KG-grounded evidence.
Xingrui Zhuo, Jia-Pu Wang, Manzong Huang et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.