aiqbench analysis
SABET-QA introduces a novel framework for Temporal Knowledge Graph Question Answering (TKGQA) that addresses the limitations of single-pass reasoning pipelines in handling multi-step temporal queries. By employing iterative state refinement and a differentiable working memory, the method achieves consistent performance gains on complex benchmarks like CronQuestions and MultiTQ. This work advances the field of AI by improving how models align question semantics with time-sensitive knowledge structures.
SABET-QA: Temporal Knowledge Graph Question Answering
arXiv:2608.20083v1 Announce Type: new Abstract: Question Answering over Temporal Knowledge Graphs (TKGQA) requires reasoning over time-sensitive facts, yet existing embedding-based methods struggle with multi-step queries due to single-pass reasoning pipelines. We propose SABET-QA, a framework that iteratively refines reasoning states across multiple hops via a bidirectional entity-temporal scoring mechanism and a slot-aware contextualization module that aligns question semantics with temporal KG embeddings. A differentiable working memory enables progressive hypothesis refinement, while auxiliary temporal boundaries serve as coarse supervision when available. Experiments on CronQuestions, Complex-CronQuestions, MultiTQ, and TimeQuestions demonstrate consistent improvements over strong baselines, particularly on complex multi-step temporal queries.
Abstract:Question Answering over Temporal Knowledge Graphs (TKGQA) requires reasoning over time-sensitive facts, yet existing embedding-based methods struggle with multi-step queries due to single-pass reasoning pipelines. We propose SABET-QA, a framework that iteratively refines reasoning states across multiple hops via a bidirectional entity-temporal scoring mechanism and a slot-aware contextualization module that aligns question semantics with temporal KG embeddings. A differentiable working memory enables progressive hypothesis refinement, while auxiliary temporal boundaries serve as coarse supervision when available. Experiments on CronQuestions, Complex-CronQuestions, MultiTQ, and TimeQuestions demonstrate consistent improvements over strong baselines, particularly on complex multi-step temporal queries.
Computation and Language (cs.CL); Artificial Intelligence (cs.AI)
arXiv:2608.20083 [cs.CL]
(or arXiv:2608.20083v1 [cs.CL] for this version)
https://doi.org/10.48550/arXiv.2608.20083 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 192 words
Related coverage
VL-MemKnG: Hybrid Memory with a Spatio-Temporal Knowledge Graph for Question Answering over Long Egocentric Navigation Trajectories
arXiv · Jun 17, 2026
NS-ST-GraphRAG: Neuro-Symbolic Spatio-Temporal GraphRAG for Literary Knowledge Processing
arXiv · Sep 7, 2026
OntoKG-EQ: A provenance-grounded, competency-question-governed knowledge graph for auditable analyst querying
arXiv · Sep 9, 2026
SCoP: Structured Constraint Parsing for Evidence-Space Control in Temporal Knowledge Graph Question Answering
arXiv · Sep 22, 2026