Confidential — Stefan Michaelcheck Only

1138 - GraphOracle: Efficient Fully-Inductive Knowledge Graph Reasoning via Relation-Dependency Graphs

2026model innovationnovelmethod

Association for Artificial Intelligence 2026, Yongqi Zhang, Siyi Liu, Enjun Du

Open MIND

https://doi.org/10.48448/8h43-6a31OpenAlex: W7128683794
1
URLs Found
0
Internal Citations
4
Authors
usable
Abstract Quality
GPT-5.5 Abstract Analysis

Problems Identified (4)

Fully-inductive KG reasoning: Knowledge graph reasoning is challenging when both test-time entities and relations are unseen during training.

Cross-domain KG generalization: The work addresses reasoning performance in cross-domain scenarios.

Fully-inductive KG reasoning: Knowledge graph reasoning is challenging when both test-time entities and relations are unseen during training.

Cross-domain KG generalization: The work addresses reasoning performance in cross-domain scenarios.

Proposed Solutions (5)

GraphOracle RDG framework: GraphOracle transforms each knowledge graph into a Relation-Dependency Graph to support robust fully-inductive reasoning.

Relation-dependency graph encoding: The Relation-Dependency Graph encodes directed precedence links between relations to capture compositional patterns while reducing graph density.

Query-conditioned attention propagation: A multi-head attention mechanism conditioned on the query relation propagates information over the RDG to create context-aware relation embeddings.

Relation-guided inductive GNN: The generated relation embeddings guide a second GNN to perform inductive message passing over the original knowledge graph.

GraphOracle RDG framework: GraphOracle transforms each knowledge graph into a Relation-Dependency Graph to support robust fully-inductive reasoning.

Results (3)

Improved fully-inductive performance:

Improved cross-domain performance:

RDG attention ablation support:

Research Domain

knowledge graph reasoning

← Back to all papers