mlsanityData to 7 Oct 2026

Reasoning over Hierarchical Question Decomposition Tree for Explainable Question Answering

arXiv 2305.15056 ↗First posted 24 May 2023cs.CLcited by 11

Not on the map. Why?

Abstract (arXiv)

Explainable question answering (XQA) aims to answer a given question and provide an explanation why the answer is selected. Existing XQA methods focus on reasoning on a single knowledge source, e.g., structured knowledge bases, unstructured corpora, etc. However, integrating information from heterogeneous knowledge sources is essential to answer complex questions. In this paper, we propose to leverage question decomposing for heterogeneous knowledge integration, by breaking down a complex question into simpler ones, and selecting the appropriate knowledge source for each sub-question. To facilitate reasoning, we propose a novel two-stage XQA framework, Reasoning over Hierarchical Question Decomposition Tree (RoHT). First, we build the Hierarchical Question Decomposition Tree (HQDT) to understand the semantics of a complex question; then, we conduct probabilistic reasoning over HQDT from root to leaves recursively, to aggregate heterogeneous knowledge at different tree levels and search for a best solution considering the decomposing and answering probabilities. The experiments on complex QA datasets KQA Pro and Musique show that our framework outperforms SOTA methods significantly, demonstrating the effectiveness of leveraging question decomposing for knowledge integration and our RoHT framework.

Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). Builds on 28 of its 47 references that are in the map. First posted on arXiv 24 May 2023.

Builds on

28 of 47 references.

References · 28

  1. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
  2. 2022Chain-of-Thought Prompting Elicits Reasoning in Large Language Modelscited by 12,302
  3. 2019BART: Denoising Sequence-to-Sequence Pre-training for Natural Language Generation, Translation, and Comprehensioncited by 5,874
  4. 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,115
  5. 2020Longformer: The Long-Document Transformercited by 3,362
  6. 2022Learn to Explain: Multimodal Reasoning via Thought Chains for Science Question Answeringcited by 1,881
  7. 2017Modeling Relational Data with Graph Convolutional Networkscited by 1,684
  8. 2022Least-to-Most Prompting Enables Complex Reasoning in Large Language Modelscited by 1,397
  9. 2021MuSiQue: Multihop Questions via Single-hop Question Compositioncited by 893
  10. 2022Decomposed Prompting: A Modular Approach for Solving Complex Taskscited by 554
  11. 2016Key-Value Memory Networks for Directly Reading Documentscited by 223
  12. 2019PullNet: Open Domain Question Answering with Iterative Retrieval on Knowledge Bases and Textcited by 182
16 more
  1. 2017Variational Reasoning for Question Answering with Knowledge Graphcited by 170
  2. 2018Open Domain Question Answering Using Early Fusion of Knowledge Bases and Textcited by 167
  3. 2020Break It Down: A Question Understanding Benchmarkcited by 131
  4. 2019Multi-hop Reading Comprehension through Question Decomposition and Rescoringcited by 119
  5. 2020Unsupervised Question Decomposition for Question Answeringcited by 118
  6. 2016Neural Symbolic Machines: Learning Semantic Parsers on Freebase with Weak Supervisioncited by 101
  7. 2022Successive Prompting for Decomposing Complex Questionscited by 94
  8. 2020KQA Pro: A Dataset with Explicit Compositional Programs for Complex Question Answering over Knowledge Basecited by 76
  9. 2020UniK-QA: Unified Representations of Structured and Unstructured Knowledge for Open-Domain Question Answeringcited by 61
  10. 2021TransferNet: An Effective and Transparent Framework for Multi-hop Question Answering over Relation Graphcited by 60
  11. 2020SPARQA: Skeleton-based Semantic Parsing for Complex Questions over Knowledge Basescited by 47
  12. 2021Program Transfer for Answering Complex Questions over Knowledge Basescited by 34
  13. 2013Lambda Dependency-Based Compositional Semanticscited by 26
  14. 2017Question Answering on Knowledge Bases and Text using Universal Schema and Memory Networkscited by 15
  15. 2022Interpretable AMR-Based Question Decomposition for Multi-hop Question Answeringcited by 12
  16. 2020F1 is Not Enough! Models and Evaluation Towards User-Centered Explainable Question Answeringcited by 11

Built on by

Cited by year

Citing papers per year: 2023: 3; 2024: 5; 2025: 3.

11 papers.