Zhen Yang, Ziwei Du, Minghan Zhang, Wei Du, Jie Chen, Fulan Qian, Shu Guo Zhao · ACM Transactions on Information Systems 2026 · 2026
DOI: 10.1145/3848125
Counts differ because each database indexes a different set of publications. We treat OpenAlex as the canonical count; Google Scholar is not shown (no API, and crawling it violates its ToS).
Table Question Answering (TableQA) requires reasoning over natural language questions and structured tables, and remains challenging due to noisy evidence and complex multi-step reasoning. Recent Large Language Model (LLM)-based approaches typically adopt decomposition–reasoning–validation pipelines that combine Chain-of-Thought (CoT) decomposition, Direct Prompting (DP), Python Agent (PyAgent) execution, and self-validation. However, these methods still largely rely on unconstrained LLM reasoning during decomposition, which may introduce unsupported sub-questions and irrelevant evidence expansion. We propose EV idence- A ware (EVA), a framework that explicitly grounds decomposition on question-relevant table evidence before reasoning begins. EVA first extracts evidence-aware relational structures that associate question semantics with supporting table attributes, thereby constraining sub-question generation within a grounded evidence space. EVA further introduces relation-guided validation and integrates both DP and PyAgent reasoning to improve robustness across different reasoning patterns. Experiments on datasets across multiple LLMs demonstrate that EVA consistently improves reasoning reliability and achieves strong performance across diverse TableQA settings.
No comments yet — start the discussion below.