The paper introduces SymbolLKG, a neuro-symbolic framework that combines a Logical Knowledge Graph (LKG) with dynamic solver routing to improve logical reasoning in large language models. The LKG represents logical rules and constraints as topological nodes, enabling explicit modeling of dependencies extracted from text. A Logic Router dispatches tasks to the most suitable symbolic engine, supported by a topology-aware hybrid retrieval mechanism, and the approach outperforms existing prompting and RAG baselines on logical reasoning benchmarks.
By Haizhao Fan, Yuchi Xiong, Jize Wang, Xinping Guan, Xinyi Le
The paper introduces SymbolLKG, a neuro-symbolic framework that combines a Logical Knowledge Graph (LKG) with dynamic solver routing to improve logical reasoning in large language models. The LKG represents logical rules and constraints as topological nodes, allowing explicit modeling of dependencies extracted from text. A Logic Router dispatches tasks to the most suitable symbolic engine, supported by a topology-aware hybrid retrieval mechanism, and the approach outperforms existing prompting and RAG baselines on logical reasoning benchmarks.
The paper introduces a neuro‑symbolic framework for constructing knowledge graphs (KGs) that are grounded in an ontology. It combines open‑domain extraction, embedding‑based canonicalization of types and predicates, and a post‑extraction LLM‑based correction step to fix ontology violations, thereby reducing token usage and improving KG consistency. The resulting KGs support symbolic querying, as evidenced by the prevalence of SPARQL graph patterns in the extracted data.
By Lorenzo Loconte, Timothy Hospedales, Cristina Cornelio
arXiv:2601.10485v5 Announce Type: replace
Abstract: Domain-specific knowledge graphs (DKGs) are critical yet often suffer from limited coverage compared to General Knowledge Graphs (GKGs). Existing t...
By Runhao Zhao, Weixin Zeng, Wentao Zhang, Chong Chen, Zhengpin Li, Xiang Zhao, Lei Chen
arXiv:2607. 14149v1 Announce Type: new Abstract: Although large language models (LLMs) have set benchmarks for zero-shot reasoning, their deployment remains cost-prohibitive and environmentally taxing.
By Dimitrios Kelesis, Konstantinos Bougiatiotis, Georgios Paliouras
arXiv:2602. 15353v3 Announce Type: replace-cross Abstract: Large pretrained language models and neural reasoning systems have advanced many natural language tasks, yet they remain challenged by knowledge-intensive queries that require precise, structured multi-hop inference.
By Rong Fu, Yang Li, Zeyu Zhang, Jiekai Wu, Yaohua Liu, Shuaishuai Cao, Yangchen Zeng, Yuhang Zhang, Xiaojing Du, Simon Fong
The paper introduces a neuro‑symbolic framework for scientific reasoning that separates symbolic validity and semantic groundedness. A deterministic symbolic verifier acts as a hard filter to guarantee syntactic and arithmetic correctness, while a Process Reward Model (PRM) is trained on verifier‑accepted steps to assess contextual grounding. The authors propose Counterfactual Symbolic Perturbation (CSP) to generate hard negative examples that pass the verifier but are logically flawed, enabling efficient PRM training and a verifier‑first constrained search at inference.
By Yuxin Zi, Cong Xu, Suparna Bhattacharya, Martin Foltin, Amit Sheth
arXiv:2605. 22093v3 Announce Type: replace Abstract: Knowledge graphs have become the primary vehicle for data integration and are critical to the success of modern AI, but the diversity of KG modelling practices, from lightweight vocabularies to richly axiomatised ontologies, makes integration and reuse expensive and brittle.
By Enrico Daga, Valentina Tamma, Terry Payne
arXiv:2608. 08567v1 Announce Type: new Abstract: A central obstacle in building graph foundation models is the input heterogeneity in terms of feature space dimensionality, semantics, and structure.
By Omer Yom Tov, Avigdor Gal
arXiv:2606. 03307v1 Announce Type: cross Abstract: Graph foundation models (GFMs) emerged as a dominant paradigm in graph representation learning by leveraging large-scale pre-training for cross-domain inference.
By Yifan Jin, Qirui Ji, Bin Qin, Jiangmeng Li, Lixiang Liu, Fuchun Sun, Changwen Zheng
arXiv:2607. 00341v1 Announce Type: cross Abstract: Large language models achieve strong performance on many reasoning tasks when allowed to externalize intermediate steps as Chain-of-Thought (CoT).
By Hengyu Fu, Tianyu Guo, Zixuan Wang, Hanlin Zhu, Jason D. Lee, Jiantao Jiao, Stuart Russell, Song Mei
The paper introduces WFM, a Wiki Foundation Model designed to support complex agentic reasoning by combining dense document contexts with markdown-based topological linkages. It formalizes a Wiki Graph schema that preserves explicit topologies while embedding continuous semantics, and employs a query‑conditioned attentive aggregation for efficient message passing. The authors also propose an NCCL‑based protocol to reduce distributed system overhead, achieving a 10.5× training speedup and strong performance on long‑term memory and multi‑hop reasoning benchmarks.
By Junnan Dong, Linhao Luo, Senlei Zhang, Gong Chen, Taian Guo, Yifei Yu, Rong Tao, Tao Guo, Qian-Wen Zhang, Siyu An, Ruizhi Qiao, Xing Sun