arXiv:2607. 09666v1 Announce Type: cross Abstract: Graph Neural Networks (GNNs) have emerged as a powerful paradigm in Knowledge Graphs (KGs) due to their intrinsic ability to model graph-structured data.
arXiv:2607. 16198v1 Announce Type: new Abstract: Graph Neural Networks (GNNs) have emerged as the leading paradigm for link prediction, enabling the inference of missing connections and the anticipation of potential future links.
arXiv:2606. 05639v1 Announce Type: new Abstract: Knowledge Graph Completion (KGC) aims at predicting missing triplets from incomplete knowledge graphs, which is crucial for downstream applications.
The article surveys neural-symbolic reasoning over knowledge graphs from a query perspective, highlighting the limitations of traditional symbolic methods when dealing with incomplete or noisy data. It discusses how the fusion of deep learning and symbolic reasoning—termed Neural Symbolic AI—offers interpretable and versatile solutions, and examines the role of large language models in advancing knowledge graph inference. The survey provides a comprehensive review of query types, classification of neural-symbolic approaches, and future directions for integrating LLMs with knowledge graph reasoning.
Large Language Models (LLMs) have advanced rapidly, but their limitations in structured and multi-hop reasoning underscore the need for graph-native, synergistic artificial intelligence (AI) systems. Graph-structured data underpins critical applications across social, biological, financial, transportation, web, and knowledge domains, making it essential to understand how LLMs can leverage graph computation for grounded, context-rich inference.
arXiv:2506.05626v3 Announce Type: replace Abstract: Real-world knowledge can take various forms, including structured, semi-structured, and unstructured data. Among these, Knowledge Graphs (KGs) are...
arXiv:2606. 11560v1 Announce Type: cross Abstract: Large Language Models (LLMs) have advanced rapidly, but their limitations in structured and multi-hop reasoning underscore the need for graph-native, synergistic artificial intelligence (AI) systems.
arXiv:2606. 16509v1 Announce Type: new Abstract: Link prediction in knowledge graphs fundamentally depends on the quality of learned embeddings for entities and relations.
arXiv:2609.08709v1 Announce Type: new Abstract: Designing foundation models for graphs is challenging due to the irregular structure of graphs and the different sizes and characteristics of embedding...
KGFR introduces a Knowledge Graph Foundation Retriever that collaborates with large language models to enhance knowledge‑intensive question answering. By encoding relations with LLM‑generated descriptions and initializing entities from question roles, KGFR enables zero‑shot generalization to unseen knowledge graphs. Its Asymmetric Progressive Propagation technique efficiently handles large graphs, while a controllable reasoning loop allows the LLM to request candidate answers, supporting facts, and reasoning paths.
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.
The paper introduces PromptGFM, a Graph Foundation Model designed for text‑attributed graphs (TAGs). It integrates Large Language Models (LLMs) and Graph Neural Networks (GNNs) through a Graph Understanding Module that prompts LLMs to emulate GNN workflows, and a Graph Inference Module that creates a language‑based graph vocabulary for better alignment and scalability. Experiments show PromptGFM outperforms existing methods and transfers effectively across various graphs and tasks.
arXiv:2604. 12503v2 Announce Type: replace-cross Abstract: Large Language Models (LLMs) have shown remarkable capabilities across various tasks but remain prone to hallucinations in knowledge-intensive scenarios.