Pith. sign in

REVIEW 2 cited by

A Foundation Model for Zero-shot Logical Query Reasoning

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2404.07198 v2 pith:OBPH73TE submitted 2024-04-10 cs.AI cs.LG

A Foundation Model for Zero-shot Logical Query Reasoning

classification cs.AI cs.LG
keywords logicalultraqueryansweringclqamodelqueryreasoningzero-shot
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

Complex logical query answering (CLQA) in knowledge graphs (KGs) goes beyond simple KG completion and aims at answering compositional queries comprised of multiple projections and logical operations. Existing CLQA methods that learn parameters bound to certain entity or relation vocabularies can only be applied to the graph they are trained on which requires substantial training time before being deployed on a new graph. Here we present UltraQuery, the first foundation model for inductive reasoning that can zero-shot answer logical queries on any KG. The core idea of UltraQuery is to derive both projections and logical operations as vocabulary-independent functions which generalize to new entities and relations in any KG. With the projection operation initialized from a pre-trained inductive KG reasoning model, UltraQuery can solve CLQA on any KG after finetuning on a single dataset. Experimenting on 23 datasets, UltraQuery in the zero-shot inference mode shows competitive or better query answering performance than best available baselines and sets a new state of the art on 15 of them.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. GraphVec: Cross-Domain Graph Vectorization for Graph-Level Representation Learning

    cs.LG 2026-02 unverdicted novelty 7.0

    GraphVec produces transferable fixed-dimensional graph embeddings via spectral features from multi-scale global graphs and a convergent mean-alignment procedure, outperforming baselines on cross-domain few-shot classi...

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

    cs.AI 2026-07 conditional novelty 6.0

    Combining graph wavelet embeddings with Neural Bellman-Ford message passing reduces the layers needed for inductive logical query answering on large knowledge graphs.