arXiv Computation and Language By Feng Liang, Weixin Zeng, Runhao Zhao, Mingjun Zhou, Shaoshi Yang, Xiang Zhao

ChronoSynth: Constraint-Aware Question Synthesis over Temporal Knowledge Graphs

Read the original on arXiv Computation and Language →

ChronoSynth is a new framework for generating natural‑language questions from temporal knowledge graphs while preserving essential constraints such as answer field, time condition, reference event, and temporal order. It introduces a Temporal Intent State to make question semantics explicit, retrieves compatible typed patterns from a memory, adapts them to the input graph, and validates the output, using feedback to revise any inconsistencies. Experiments on CRONQUESTIONS and MultiTQ show that ChronoSynth achieves state‑of‑the‑art performance, with ablation studies confirming the effectiveness of its components.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Computation and Language.

arXiv AI
Aug 21

SABET-QA: Temporal Knowledge Graph Question Answering

arXiv:2608. 20083v1 Announce Type: cross 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.

By Brahim Touayouch, Mirette Moawad, Dmitry Akulov
Hugging Face Trending Papers
Aug 20

SABET-QA: Temporal Knowledge Graph Question Answering

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.