Neural Information Processing Systems http://nips.cc/

Reasoning on large-scale knowledge graphs has been long dominated by embedding methods. While path-based methods possess the inductive capacity that embeddings lack, their scalability is limited by the exponential number of paths. Here we present A*Net, a scalable path-based method for knowledge graph reasoning. Inspired by the A* algorithm for shortest path problems, our A*Net learns a priority function to select important nodes and edges at each iteration, to reduce time and memory footprint for both training and inference. The ratio of selected nodes and edges can be specified to trade off between performance and efficiency. Experiments on both transductive and inductive knowledge graph reasoning benchmarks show that A*Net achieves competitive performance with existing state-of-the-art path-based methods, while merely visiting 10% nodes and 10% edges at each iteration. On a million-scale dataset ogbl-wikikg2, A*Net not only achieves a new state-of-the-art result, but also converges faster than embedding methods. A*Net is the first path-based method for knowledge graph reasoning at such scale.

Large Language Models (LLMs) enhanced with retrieval -- commonly referred to as Retrieval-Augmented Generation (RAG) -- have demonstrated strong performance in knowledge-intensive tasks. However, RAG pipelines often fail when retrieved evidence is incomplete, leaving gaps in the reasoning process. In such cases, \emph{abductive inference} -- the process of generating plausible missing premises to explain observations -- offers a principled approach to bridge these gaps. In this paper, we propose a framework that integrates abductive inference into retrieval-augmented LLMs. Our method detects insufficient evidence, generates candidate missing premises, and validates them through consistency and plausibility checks. Experimental results on abductive reasoning and multi-hop QA benchmarks show that our approach improves both answer accuracy and reasoning faithfulness. This work highlights abductive inference as a promising direction for enhancing the robustness and explainability of RAG systems.

However, the inference in MLNs is usually very difficult due to the complicated graph structures.

The supplementary material is structured as follows: Section A.1 gives the proof and analysis of Theorem 3.1; Section A.2 introduces the datasets and their statistics in detail; Section A.3 introduces the baselines utilized in experiments; Section A.4 discusses the experimental setup of baseline models as well as MetaTKGR; Section A.5 reports detailed experiment performance with statistical test results; A.1 Statements, Proof and Analysis of Theorem 3.1 Thus, we can improve the generalization ability of our meta-learner over time by the following update step by step, A.2 Datasets Figure 1: Number of entities over time. New entities continuously emerge on three public TKGs. Integrated Crisis Early Warning System (ICEWS18) is the collection of coded interactions between 3 socio-political actors which are extracted from news articles. Y AGO). Figure 1 shows the amount of new entities appearing over time. Figure 2 shows the corresponding distributions.