arXiv:2607. 14770v1 Announce Type: new Abstract: Knowledge graph question generation (KGQG) aims to generate natural-language questions from structured graph evidence.
By Xuemeng Liu, Zhengpin Li, Wanpeng Tang, Haotong Xie, Wentao Zhang
arXiv:2610.28176v1 Announce Type: cross
Abstract: Large Language Models (LLMs) often struggle with temporally grounded reasoning because their static parametric memory is misaligned with the dynamic...
By Jiapu Wang
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
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.
By Feng Liang, Weixin Zeng, Runhao Zhao, Mingjun Zhou, Shaoshi Yang, Xiang Zhao
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.
arXiv:2606. 01591v1 Announce Type: cross Abstract: The TimeLogic Challenge evaluates formal temporal-logic reasoning over video - 16 operators (before, after, until, since, always, co-occur, ordering, ...
By Ali Alavi
arXiv:2608. 16224v1 Announce Type: cross Abstract: By leveraging large-scale pretraining, LLMs can interpret diverse temporal expressions and question formulations without task-specific training.
By Xinlong Dai, Jinchuan Zhang, Lei Gao, Xinzhe Hu, Yuefeng He, Hui Gao
arXiv:2606. 00029v1 Announce Type: cross Abstract: Retrieval-augmented generation systems struggle with temporal reasoning and evidence fusion when answering complex questions over historical criminal case narratives.
By Sidra Nasir, Muhammad Noman Zahid, Rizwan Ahmed Khan
arXiv:2609.23880v1 Announce Type: new
Abstract: Temporal Information Retrieval (TIR) has been increasingly critical given the rise of Retrieval-Augmented Generation (RAG). Since temporally mismatched...
By Soyeon Kim, Hyunjin Kim, JinYeong Bak, Steven Euijong Whang
arXiv:2601.07148v4 Announce Type: replace-cross
Abstract: Tool use, such as web search, has become a standard capability even in freely available large language models (LLMs). However, existing bench...
By Zhengxiang Wang, Zeyu Dong
arXiv:2606. 28076v1 Announce Type: new Abstract: Knowledge graph question answering (KGQA) aims to answer natural-language questions by reasoning over structured facts.
By Yongxue Shan, Meihan Wu, Cundi Fang, Jie Peng, Xiaodong Wang
NS-ST-GraphRAG is a neuro‑symbolic spatio‑temporal GraphRAG framework designed to process long‑form literary narratives by integrating ontology‑guided extraction, deterministic constraint checking, dual temporal coordinates, spatial scene attributes, and dynamic sub‑graph retrieval. It selects the appropriate graph state based on the temporal and spatial scope of a query, grounding generated answers in traceable evidence. The authors also introduce Red‑Chamber‑QA, an open multi‑hop question‑answering benchmark for classical Chinese literature, and report that NS‑ST‑GraphRAG outperforms a frozen‑window baseline and a closed‑book model on a held‑out 120‑question split.
By Zheng Kui Lin