STAIR: Semantic-Temporal Automaton for Interpretable Reasoning in Temporal Question Answering

• URL: http://arxiv.org/abs/2608.16224v1
• Date: Mon, 17 Aug 2026 07:59:45 GMT
• Title: STAIR: Semantic-Temporal Automaton for Interpretable Reasoning in Temporal Question Answering
• Abstract summary: We present STAIR, a textbfSemantic-textbfTemporal textbfAutomaton for textbfInterpretable textbfReasoning.<n>An answer-free LLM adapter maps complex question formulations to normalized temporal intents, while a deterministic temporal automaton executes the corresponding policies over canonicalized evidence.<n> STAIR consistently outperforms strong baselines in the TimeQA-Easy, TimeQA-Hard, TempReason-L2, and TempReason-L3 datasets.
• Score: 7.774935839413563
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: By leveraging large-scale pretraining, LLMs can interpret diverse temporal expressions and question formulations without task-specific training. However, existing prompt-based neuro-symbolic systems continue to rely on LLMs for both semantic interpretation and exact temporal inference. Consequently, discrete decisions regarding intervals, time anchors, and ordered states remain vulnerable to probabilistic errors and difficult to verify. We present STAIR, a \textbf{S}emantic-\textbf{T}emporal \textbf{A}utomaton for \textbf{I}nterpretable \textbf{R}easoning. STAIR separates semantic interpretation from precise temporal inference: an answer-free LLM adapter maps complex question formulations to normalized temporal intents, while a deterministic temporal automaton with finite control and guarded transitions executes the corresponding policies over canonicalized evidence. Following a rule-first design, STAIR resolves standard questions without invoking an LLM and applies semantic adaptation only when the rule path fails to produce an executable intent. This approach reduces free-form reasoning, making temporal decisions verifiable and interpretable. Specifically, guarded execution supports precise point-time containment and before/after selection, while semantic adaptation handles non-exact intervals and time-anchored queries. Across the TimeQA-Easy, TimeQA-Hard, TempReason-L2, and TempReason-L3 datasets, STAIR consistently outperforms strong baselines in the TQA task using matched model settings, achieving average F1 improvements of 16.57\% and 3.10\% when utilizing the Qwen2.5-7B and GPT-4o-mini models, respectively. Furthermore, ablations and diagnostic analyses demonstrate that STAIR excels at handling both boundary-sensitive and order-sensitive queries, while its guarded execution and semantic adaptation ensure precise point-time reasoning and inexact intervals, respectively.

Related papers

• On Synthesis of Metric Interval Temporal Logics [0.5505634045241289]
  This paper presents the first framework to tackle emphprecise passive learning for an expressive timed logic.<n>Our approach formally reduces the timed learning problem into a scalable untimed one.<n>We evaluate our implementation across several benchmarks, demonstrating the effectiveness of our approach.
  arXiv  Detail & Related papers  (2026-09-01T10:30:46Z)
• Beyond Tokenization: Direct Timestep Embedding and Contrastive Alignment for Time-Series Question Answering [13.074536659496362]
  Recent advances in large language models (LLMs) have given rise to time-series question answering (TSQA)<n>TSQA formulates time-series analysis as natural-language question answering.<n>To address this challenge, we propose CADE, a novel framework for TSQA built upon two key components: direct timestep embedding and semantic alignment.
  arXiv  Detail & Related papers  (2026-06-17T12:07:23Z)
• InA-Probe: Instruction-Aware Active Probing for Time Series Forecasting with LLMs [45.91332553359387]
  Large Language Models (LLMs) have recently demonstrated impressive potential for time series forecasting.<n>We propose Instruction-aware Active Probing (InA-Probe), which shifts the paradigm from passive alignment toward an active, instruction-driven probing mechanism.<n>In experiments, InA-Probe consistently outperforms state-of-the-art deep learning and LLM-based baselines.
  arXiv  Detail & Related papers  (2026-06-07T12:27:13Z)
• EASE-TTT: Evidence-Aligned Selective Test-Time Training for Long-Context Question Answering [61.89411578705886]
  We propose Evidence-Aligned SElective Test-Time Training (EASE-TTT) for long-context question answering.<n>EASE-TTT converts selected evidence chunks into a soft attention supervision target over their token positions.<n>It achieves the strongest macro-average performance among full-context inference, retrieval-only baselines, and qTTT.
  arXiv  Detail & Related papers  (2026-06-05T04:49:37Z)
• From Prompts to Pavement Through Time: Temporal Grounding in Agentic Scene-to-Plan Reasoning [1.2777067998526854]
  This work explores whether temporal conditioning within inter-agent communication can preserve or enhance coherence without introducing degradation in semantic or logical consistency.<n>Results show that while temporal conditioning reshapes reasoning style, it yields no statistically significant improvements in standard NLP-based correctness metrics.<n>These findings clarify the limits of prompt-based temporal grounding and establish the first empirical benchmark for temporal scene-to-plan reasoning.
  arXiv  Detail & Related papers  (2026-05-19T13:18:35Z)
• AdapTime: Enabling Adaptive Temporal Reasoning in Large Language Models [65.97075015662318]
  AdapTime is an adaptive temporal reasoning method that dynamically executes reasoning steps based on the input context.<n>It integrates seamlessly with state-of-the-art LLMs and significantly enhances their temporal reasoning capabilities without relying on external support.
  arXiv  Detail & Related papers  (2026-04-27T08:34:40Z)
• Teaching LLMs to Ask: Self-Querying Category-Theoretic Planning for Under-Specified Reasoning [1.8055130471307603]
  Inference-time planning with large language models frequently breaks under partial observability.<n>We introduce textbfSelf-Querying Bidirectional Categorical Planning (SQ-BCP), which explicitly represents precondition status.<n>We prove that when the verifier succeeds and hard constraints pass deterministic checks, accepted plans are compatible with goal requirements.
  arXiv  Detail & Related papers  (2026-01-27T19:41:10Z)
• Chain-of-thought Reviewing and Correction for Time Series Question Answering [22.889720488678076]
  We propose T3LLM, which performs multi-step reasoning with an explicit correction mechanism for time series question answering.<n>Within this framework, the worker generates step-wise chains of thought (CoT) under structured prompts, while the reviewer inspects the reasoning, identifies erroneous steps, and provides corrective comments.<n>Experiments on multiple real-world TSQA benchmarks demonstrate that T3LLM achieves state-of-the-art performance over strong LLM-based baselines.
  arXiv  Detail & Related papers  (2025-12-27T15:54:18Z)
• Intra-request branch orchestration for efficient LLM reasoning [52.68946975865865]
  Large Language Models (LLMs) increasingly rely on inference-time reasoning algorithms to improve accuracy on complex tasks.<n>Prior work has largely focused on reducing token usage, often at the expense of accuracy, while overlooking other latency factors.<n>We present DUCHESS, an LLM serving system that reduces cost and latency without sacrificing accuracy through intra-request branch orchestration guided by predictions.
  arXiv  Detail & Related papers  (2025-09-29T15:52:08Z)
• Temporal Information Retrieval via Time-Specifier Model Merging [9.690250070561461]
  Time-Specifier Model Merging (TSM) is a novel method that enhances temporal retrieval while preserving accuracy on non-temporal queries.<n>Extensive experiments on both temporal and non-temporal datasets demonstrate that TSM significantly improves performance on temporally constrained queries.
  arXiv  Detail & Related papers  (2025-07-09T12:16:11Z)
• LLM-Symbolic Integration for Robust Temporal Tabular Reasoning [69.27153114778748]
  We introduce TempTabQA-C, a synthetic dataset designed for systematic and controlled evaluations.<n>This structured approach allows Large Language Models (LLMs) to generate and executesql queries, enhancing generalization and mitigating biases.
  arXiv  Detail & Related papers  (2025-06-06T05:14:04Z)
• Temporally Grounding Instructional Diagrams in Unconstrained Videos [51.85805768507356]
  We study the challenging problem of simultaneously localizing a sequence of queries in instructional diagrams in a video.<n>Most existing methods focus on grounding one query at a time, ignoring the inherent structures among queries.<n>We propose composite queries constructed by exhaustively pairing up the visual content features of the step diagrams.<n>We demonstrate the effectiveness of our approach on the IAW dataset for grounding step diagrams and the YouCook2 benchmark for grounding natural language queries.
  arXiv  Detail & Related papers  (2024-07-16T05:44:30Z)
• UnSeenTimeQA: Time-Sensitive Question-Answering Beyond LLMs' Memorization [34.257914212541394]
  This paper introduces UnSeenTimeQA, a novel data contamination-free time-sensitive question-answering benchmark.<n>It differs from existing TSQA benchmarks by avoiding web-searchable queries grounded in the real world.<n>It requires large language models (LLMs) to engage in genuine temporal reasoning without depending on the factual knowledge acquired during the pre-training phase.
  arXiv  Detail & Related papers  (2024-07-03T22:02:07Z)
• Unlocking Temporal Question Answering for Large Language Models with Tailor-Made Reasoning Logic [84.59255070520673]
  Large language models (LLMs) face a challenge when engaging in temporal reasoning. We propose TempLogic, a novel framework designed specifically for temporal question-answering tasks.
  arXiv  Detail & Related papers  (2023-05-24T10:57:53Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.