Sep 2026· ACM Transactions on Information Systems· 0 citations· 71 references
TL;DR
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 different reasoning patterns.
Abstract
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 EVidence-Aware (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.
PARTAB (Partition-Aware Reasoning overTables), a framework that constructs a structured evidence interface between the LLM and the table, demonstrates the value of structured, partition aware evidence construction for scalable table reasoning.
GRS-QA is introduced, a reasoning graph-structured question answering dataset that augments multi-hop QA instances from exisiting datasets, with directed reasoning graphs representing intermediate inference steps, and highlights the importance of unified structural annotations for understanding and improving multi-hop...
Khin S. Yone, Devasha Trivedi, Anish Pahilajani et al.· International Conference on...· 0 citations
Large language models (LLMs) have demonstrated strong capabilities in question answering, yet they still frequently suffer from hallucinations on knowledge-intensive tasks. Knowledge graphs (KGs) provide LLMs with structured, interpretable, and updatable factual grounding, making them a promising external knowledge sou...
Yang Hong, Ya-Jun Yang, Xin Wang et al.· 0 citations
This work introduces DocHop, a benchmark for integrated chart--context reasoning in document-style images and constructs DocHop via a stochastic logic-first generation pipeline with controllable reasoning depth and visual density, to enable systematic evaluation.
Zhuo-Ran Yu, Le Thien Phuc Nguyen, Jaden Park et al.· 1 citation
Knowledge graph question answering (KGQA) aims to answer natural language questions by grounding them in structured knowledge graphs (KGs). Current KGQA systems still face three linked challenges: representing complex and compositional questions, providing transparent multi-hop reasoning traces, and using complete...
Experiments on WikiTQ and SLQA show that localization is particularly effective for lookup and local reasoning questions, while adaptive selection between localized and full-table reasoning achieves the best overall performance, highlighting that long-table QA requires deciding not only how to localize, but also when t...