EUVIMEDEUVIMED entdecken
Crossref

Syllogism-Inspired TableQA: Evidentialization Makes Decomposition Reasoning and Answer Verification More Reliable

Zhe Zhang, Lili Bai, Chaopeng Guo, Jie Song

Proceedings of the AAAI Conference on Artificial Intelligence · 14.03.2026 · 40 (41) · 34888-34896

DOI: 10.1609/aaai.v40i41.40792 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Proceedings of the AAAI Conference on Artificial Intelligence, online erschienen am 14.03.2026. Verfasst von Zhe Zhang und 3 weiteren Autor:innen.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Existing large language model (LLM)-based table question answering (TableQA) methods primarily involve decomposition reasoning and answer verification processes. However, decomposing questions solely at the semantic level, without considering the factual evidence in tables, fails to significantly reduce the difficulty for LLMs in understanding the key information in questions. Furthermore, reasoning and verification without supporting factual evidence are often arbitrary and unreliable. In light of these issues, this paper proposes a Syllogism-Inspired Reasoning and Verification method (SIRV), which performs reliable decomposition reasoning and answer verification based on the evidential concept of syllogism. Specifically, SIRV extracts question-relevant factual evidence from the table to construct the premises. Based on the constructed premises, SIRV plans reasoning paths and generates sub-questions that explicitly indicate relevant factual evidence, performing evidence-centered reasoning. Additionally, SIRV examines the consistency between the premises and the table to focus on factual evidence, thereby reliably identifying and correcting errors in the reasoning process. Compared to state-of-the-art methods, SIRV achieves performance improvements of up to 5.24% in single-mode and 2.89% in joint reasoning, while also demonstrating excellent generalization ability and efficiency.

Zitieren

APA

Zhang, Z., Bai, L., Guo, C., & Song, J. (2026). Syllogism-Inspired TableQA: Evidentialization Makes Decomposition Reasoning and Answer Verification More Reliable. Proceedings of the AAAI Conference on Artificial Intelligence, 40(41), 34888-34896. https://doi.org/10.1609/aaai.v40i41.40792

Vancouver

Zhang Z, Bai L, Guo C, Song J. Syllogism-Inspired TableQA: Evidentialization Makes Decomposition Reasoning and Answer Verification More Reliable. Proceedings of the AAAI Conference on Artificial Intelligence. 2026;40(41):34888-34896. doi:10.1609/aaai.v40i41.40792

BibTeX
@article{Zhang2026,
  author = {Zhang, Zhe and Bai, Lili and Guo, Chaopeng and Song, Jie},
  title = {Syllogism-Inspired TableQA: Evidentialization Makes Decomposition Reasoning and Answer Verification More Reliable},
  journal = {Proceedings of the AAAI Conference on Artificial Intelligence},
  year = {2026},
  volume = {40},
  number = {41},
  pages = {34888--34896},
  doi = {10.1609/aaai.v40i41.40792}
}
Kostenlos starten →