Skip to content

SCoP: Structured Constraint Parsing for Evidence-Space Control in Temporal Knowledge Graph Question Answering

Sep 2026 · 0 citations · 29 references
Computer Science

TL;DR

SCoP (Structured Constraint Parsing), a constraint-centric framework that externalizes temporal decisions before answer inference, separates answer-seeking event patterns from temporal anchor events, conservatively grounds them to canonical TKG entities and relations, and translates temporal intent into executable constraints with optional ranking requirements.

Abstract

Temporal Knowledge Graph Question Answering (TKGQA) requires answer inference from evidence that is both structurally valid and temporally admissible. Existing methods often leave anchor-event binding, temporal admissibility, and ordinal selection implicit in model reasoning, task-specific training, or similarity-driven retrieval, allowing locally relevant but invalid facts to enter the answer context. We formulate complex TKGQA as evidence-space control and propose SCoP (Structured Constraint Parsing), a constraint-centric framework that externalizes temporal decisions before answer inference. Instead of treating retrieved facts as admissible evidence by default, SCoP separates answer-seeking event patterns from temporal anchor events, conservatively grounds them to canonical TKG entities and relations, and translates temporal intent into executable constraints with optional ranking requirements. These constraints operate over normalized point and interval ranges, enabling deterministic filtering of structurally compatible candidates and producing a compact evidence space for generation. Experiments on MultiTQ and TimelineCronQ-R assess SCoP across timestamped point-fact and interval-oriented settings with richer temporal relations and ordering dependencies. Without task-specific parameter updates, SCoP achieves 0.825 Hits@1 on MultiTQ and 0.761 Hits@1 on TimelineCronQ-R, with gains on constraint-intensive question types. These results support explicit evidence-space control over unconstrained retrieval or implicit temporal reasoning.

View source

Similar papers

Preprint Aug 2026

Compositional Chain-of-Relations for Faithful Knowledge Graph Question Answering with Large Language Models

A relation-centric exploration paradigm is introduced, which uses relations rather than entities as search units and thus avoids unreliable entity pruning and proposes Compositional Chain-of-Relations (CCoR), a simple and effective framework that grounds both phases in the KG with two relation chains.

Chenhui Liu, Jianpeng Zhou, Jia-Hai Wang · 0 citations
Open access 2026

EviGraphRAG: Constraint-Verified Retrieval-Augmented Question Answering over Event Knowledge Graphs

EviGraphRAG is proposed, a ranker-agnostic reliability layer that separates candidate ranking from exact verification and explicit abstention, and exact conjunction over represented event constraints and linked source-record connectivity can improve selective reliability, while parser quality and candidate retrieval re...

Yu-Teng Sun, Yang Su, Xu-An Wang · 0 citations
Nov 2026

Structure Pruning With LLMs for Knowledge Graph Question Answering

Knowledge Graph Question Answering (KGQA) requires multi-step reasoning over a large, structured search space, where free-form LLM planning can hallucinate intermediate subgraphs or query sketches and yield unexecutable reasoning. We propose READS, a constraint-guided discriminative reasoning framework that makes KGQA...

Mu-Fan Xu, Ke-Hai Chen, Xue-Feng Bai et al. · 1 citation
Sep 2026

Focus on Evidence: Relational-Structure Enhances LLM Effectiveness in TableQA

EVA first extracts evidence-aware relational structures that associate question semantics with supporting table attributes that constraining sub-question generation within a grounded evidence space, and introduces relation-guided validation and integrates both DP and PyAgent reasoning to improve robustness across diffe...

Zhen Yang, Zi-Wei Du, Ming-Han Zhang et al. · 0 citations
Preprint Aug 2026

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

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.

Xin-Long Dai, Jin-Chuan Zhang, Lei Gao et al. · 0 citations

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.