InductWave: Inductive Multi-Hop Logical Query Answering on Knowledge Graphs

• URL: http://arxiv.org/abs/2607.07422v1
• Date: Wed, 08 Jul 2026 13:49:44 GMT
• Title: InductWave: Inductive Multi-Hop Logical Query Answering on Knowledge Graphs
• Abstract summary: InductWave is a wavelet-based inductive embedding method for logical query answering on large Knowledge Graphs.<n>Our model performs on par with the baseline models while having half the number of message-passing layers.<n>It outperforms all of them in most cases, with 75% of the layers.
• Score: 24.979566889505705
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Logical Multi-Hop Query Answering over Knowledge Graphs (KGs) can be formulated as querying, with an implicit completeness assumption. Current works mainly focus on Existential First Order Logic (EFO) queries. These EFO queries contain conjunction, disjunction, and negation operators. Most existing works employ transductive reasoning, meaning they are not capable of reasoning over entities unseen during training. In the real world, there is a resource scarcity, and we cannot train a model with all the nodes of a large KG. Hence, we propose InductWave, a wavelet-based inductive embedding method for logical query answering on large KGs. Here, the training graph consists of fewer nodes than the test graph. Our model performs on par with the baseline models while having half the number of message-passing layers. It outperforms all of them in most cases, with 75% of the layers. These fewer resource requirements enable us to evaluate InductWave on massive graphs, such as Wiki-KG. We test our model using extensive experiments across varying train-test graph proportions of the FB15k-(237) dataset, comparing it with the state-of-the-art models. The code and datasets for the model are available at https://github.com/kracr/inductwave/.

Related papers

• Enrich-on-Graph: Query-Graph Alignment for Complex Reasoning with LLM Enriching [61.824094419641575]
  Large Language Models (LLMs) struggle with hallucinations and factual errors in knowledge-intensive scenarios like knowledge graph question answering (KGQA)<n>We attribute this to the semantic gap between structured knowledge graphs (KGs) and unstructured queries, caused by inherent differences in their focuses and structures.<n>Existing methods usually employ resource-intensive, non-scalable reasoning on vanilla KGs, but overlook this gap.<n>We propose a flexible framework, Enrich-on-Graph (EoG), which leverages LLMs' prior knowledge to enrich KGs, bridge the semantic gap between graphs and queries.
  arXiv  Detail & Related papers  (2025-09-25T06:48:52Z)
• Look Globally and Reason: Two-stage Path Reasoning over Sparse Knowledge Graphs [70.8150181683017]
  Sparse Knowledge Graphs (KGs) contain fewer facts in the form of (head entity, relation, tail entity) compared to more populated KGs. This paper proposes a two-stage path reasoning model called LoGRe (Look Globally and Reason) over sparse KGs.
  arXiv  Detail & Related papers  (2024-07-26T07:10:27Z)
• A Foundation Model for Zero-shot Logical Query Reasoning [20.652279854090846]
  Complex logical query answering (CLQA) in knowledge graphs (KGs) goes beyond simple KG completion. We present UltraQuery, the first foundation model for inductive reasoning that can zero-shot answer logical queries on any KG.
  arXiv  Detail & Related papers  (2024-04-10T17:56:07Z)
• ReasoningLM: Enabling Structural Subgraph Reasoning in Pre-trained Language Models for Question Answering over Knowledge Graph [142.42275983201978]
  We propose a subgraph-aware self-attention mechanism to imitate the GNN for performing structured reasoning. We also adopt an adaptation tuning strategy to adapt the model parameters with 20,000 subgraphs with synthesized questions. Experiments show that ReasoningLM surpasses state-of-the-art models by a large margin, even with fewer updated parameters and less training data.
  arXiv  Detail & Related papers  (2023-12-30T07:18:54Z)
• Neural Graph Reasoning: Complex Logical Query Answering Meets Graph Databases [63.96793270418793]
  Complex logical query answering (CLQA) is a recently emerged task of graph machine learning. We introduce the concept of Neural Graph Database (NGDBs) NGDB consists of a Neural Graph Storage and a Neural Graph Engine.
  arXiv  Detail & Related papers  (2023-03-26T04:03:37Z)
• Probing Graph Representations [77.7361299039905]
  We use a probing framework to quantify the amount of meaningful information captured in graph representations. Our findings on molecular datasets show the potential of probing for understanding the inductive biases of graph-based models. We advocate for probing as a useful diagnostic tool for evaluating graph-based models.
  arXiv  Detail & Related papers  (2023-03-07T14:58:18Z)
• A Survey of Knowledge Graph Reasoning on Graph Types: Static, Dynamic, and Multimodal [57.8455911689554]
  Knowledge graph reasoning (KGR) aims to deduce new facts from existing facts based on mined logic rules underlying knowledge graphs (KGs) It has been proven to significantly benefit the usage of KGs in many AI applications, such as question answering, recommendation systems, and etc.
  arXiv  Detail & Related papers  (2022-12-12T08:40:04Z)
• Inductive Logical Query Answering in Knowledge Graphs [30.220508024471595]
  We study the inductive query answering task where inference is performed on a graph containing new entities with queries over both seen and unseen entities. We devise two mechanisms leveraging inductive node and relational structure representations powered by graph neural networks (GNNs) Experimentally, we show that inductive models are able to perform logical reasoning at inference time over unseen nodes generalizing to graphs up to 500% larger than training ones.
  arXiv  Detail & Related papers  (2022-10-13T03:53:34Z)
• Neural Methods for Logical Reasoning Over Knowledge Graphs [14.941769519278745]
  We focus on answering multi-hop logical queries on Knowledge Graphs (KGs) Most previous works have been unable to create models that accept full First-Order Logical (FOL) queries. We introduce a set of models that use Neural Networks to create one-point vector embeddings to answer the queries.
  arXiv  Detail & Related papers  (2022-09-28T23:10:09Z)
• Neural-Symbolic Models for Logical Queries on Knowledge Graphs [17.290758383645567]
  We propose Graph Neural Network Query Executor (GNN-QE), a neural-symbolic model that enjoys the advantages of both worlds. GNN-QE decomposes a complex FOL query into relation projections and logical operations over fuzzy sets. Experiments on 3 datasets show that GNN-QE significantly improves over previous state-of-the-art models in answering FOL queries.
  arXiv  Detail & Related papers  (2022-05-16T18:39:04Z)

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.