English

TAG-EQA: Text-And-Graph for Event Question Answering via Structured Prompting Strategies

Computation and Language 2025-10-03 v1

Abstract

Large language models (LLMs) excel at general language tasks but often struggle with event-based questions-especially those requiring causal or temporal reasoning. We introduce TAG-EQA (Text-And-Graph for Event Question Answering), a prompting framework that injects causal event graphs into LLM inputs by converting structured relations into natural-language statements. TAG-EQA spans nine prompting configurations, combining three strategies (zero-shot, few-shot, chain-of-thought) with three input modalities (text-only, graph-only, text+graph), enabling a systematic analysis of when and how structured knowledge aids inference. On the TORQUESTRA benchmark, TAG-EQA improves accuracy by 5% on average over text-only baselines, with gains up to 12% in zero-shot settings and 18% when graph-augmented CoT prompting is effective. While performance varies by model and configuration, our findings show that causal graphs can enhance event reasoning in LLMs without fine-tuning, offering a flexible way to encode structure in prompt-based QA.

Keywords

Cite

@article{arxiv.2510.01391,
  title  = {TAG-EQA: Text-And-Graph for Event Question Answering via Structured Prompting Strategies},
  author = {Maithili Kadam and Francis Ferraro},
  journal= {arXiv preprint arXiv:2510.01391},
  year   = {2025}
}

Comments

Accepted in *sem 2025