跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.19926 · v1

A Demonstration System for Faithful Temporal Question Answering

首次提交 2026-11-15 18:44
版本更新 2026-11-15 18:44
雷达观测 2026-11-17 12:06
arXiv ↗PDF ↗

摘要

Temporal question answering (TQA) aims to answer questions that involve temporal constraints or require temporal information. We propose Faith, a novel TQA approach that operates over heterogeneous sources and ensures explainable answers by presenting traceable and faithful evidence. In Faith, we design a new recursive answering mechanism transforming implicit temporal constraints into explicit conditions. Additionally, we visualize the system functionality to track how the answers are computed and the supporting evidence is derived. The code and video of the demonstration system are publicly available.

作者备注:4 pages, 2 figures. Demo paper

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-15 18:44 · 最新观测版本

A Demonstration System for Faithful Temporal Question Answering

Temporal question answering (TQA) aims to answer questions that involve temporal constraints or require temporal information. We propose Faith, a novel TQA approach that operates over heterogeneous sources and ensures explainable answers by presenting traceable and faithful evidence. In Faith, we design a new recursive answering mechanism transforming implicit temporal constraints into explicit conditions. Additionally, we visualize the system functionality to track how the answers are computed and the supporting evidence is derived. The code and video of the demonstration system are publicly available.

查看此版本解读 →查看此版本原文 ↗