TAG-EQA: Text-And-Graph for Event Question Answering via Structured Prompting Strategies
Maithili Kadam, Francis Ferraro
TL;DR
TAG-EQA introduces a prompting framework that injects structured causal event graphs into LLM inputs by verbalizing edges, enabling event-based QA without model fine-tuning. The method systematically explores nine configurations across three prompting strategies and three input modalities on multiple instruction-tuned LLMs, using the TORQUESTRA dataset. Results show that causal graphs improve accuracy on average (about $5\%$) with larger gains in zero-shot and chain-of-thought settings, and that graph-augmented prompting benefits specific reasoning categories such as causal and temporal inference. The work demonstrates the potential and limitations of structured prompt inputs for enhancing event reasoning in LLMs and outlines directions for robustness, automation, and broader applicability.
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.
