Papers › ExplaGraphs: An Explanation Graph Generation Task for Structured Commonsense Reasoning

ExplaGraphs: An Explanation Graph Generation Task for Structured Commonsense Reasoning

15 Apr 2021EMNLP 2021 11arXiv:2104.07644archive 2025-07-28

Swarnadeep Saha, Prateek Yadav, Lisa Bauer, Mohit Bansal

Recent commonsense-reasoning tasks are typically discriminative in nature, where a model answers a multiple-choice question for a certain context. Discriminative tasks are limiting because they fail to adequately evaluate the model's ability to reason and explain predictions with underlying commonsense knowledge. They also allow such models to use reasoning shortcuts and not be "right for the right reasons". In this work, we present ExplaGraphs, a new generative and structured commonsense-reasoning task (and an associated dataset) of explanation graph generation for stance prediction. Specifically, given a belief and an argument, a model has to predict if the argument supports or counters the belief and also generate a commonsense-augmented graph that serves as non-trivial, complete, and unambiguous explanation for the predicted stance. We collect explanation graphs through a novel Create-Verify-And-Refine graph collection framework that improves the graph quality (up to 90%) via multiple rounds of verification and refinement. A significant 79% of our graphs contain external commonsense nodes with diverse structures and reasoning depths. Next, we propose a multi-level evaluation framework, consisting of automatic metrics and human evaluation, that check for the structural and semantic correctness of the generated graphs and their degree of match with ground-truth graphs. Finally, we present several structured, commonsense-augmented, and text generation models as strong starting points for this explanation graph generation task, and observe that there is a large gap with human performance, thereby encouraging future work for this new challenging task. ExplaGraphs will be publicly available at https://explagraphs.github.io.

PaperPDFConference PDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2104.07644")

Code

Syntology Ran 0 of 11 code samples harvested from 1 repository linked to this paper; 11 have no recorded run.

By repository: official repository: 11 samples from 1 repository, 0 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

swarnaHub/ExplaGraphs officialmentioned in papermentioned on GitHubpytorchMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

11 samples harvested; 0 ran; 0 honoured the contract we drafted; 11 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

11unverified

Licence: 0 of the 11 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from swarnaHub/ExplaGraphs. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

compute_metrics swarnaHub/ExplaGraphs/src/utils_stance_pred.py official repository unverified MIT (permissive) · efbd217b0bee225c · report
compute_metrics swarnaHub/ExplaGraphs/structured_model/utils_relation.py official repository unverified MIT (permissive) · 4d0f185176bdada1 · report
convert_examples_to_features swarnaHub/ExplaGraphs/structured_model/utils_joint_model.py official repository unverified MIT (permissive) · 03334853b0b4fe82 · report
convert_examples_to_features swarnaHub/ExplaGraphs/structured_model/utils_relation.py official repository unverified MIT (permissive) · 01ce409a43a05ddd · report
get_dfs_ordering swarnaHub/ExplaGraphs/metrics/create_ea_data.py official repository unverified MIT (permissive) · 842852f49ade917d · report
get_ordered_nodes swarnaHub/ExplaGraphs/structured_model/run_joint_model.py official repository unverified MIT (permissive) · 37df5c72a313ced5 · report
get_word_start_indices swarnaHub/ExplaGraphs/structured_model/utils_joint_model.py official repository unverified MIT (permissive) · 2129f6ffd65a1a1c · report
merge_nodes swarnaHub/ExplaGraphs/structured_model/inference.py official repository unverified MIT (permissive) · fee75f7824a0d78e · report
simple_accuracy swarnaHub/ExplaGraphs/structured_model/utils_joint_model.py official repository unverified MIT (permissive) · 3c241ecfe3749a6d · report
solve_LP swarnaHub/ExplaGraphs/structured_model/inference.py official repository unverified MIT (permissive) · c60db90202654db9 · report
solve_LP_no_connectivity swarnaHub/ExplaGraphs/structured_model/inference.py official repository unverified MIT (permissive) · 2115b04d3c3dbd22 · report

Tasks

Graph GenerationMultiple-choiceText Generation

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

AdafactorAdamAttentionAttention DropoutBARTBPEDense ConnectionsDropoutGated Linear UnitInverse Square Root ScheduleLayer NormalizationLinear LayerMulti-Head AttentionResidual ConnectionSentencePieceSoftmaxT5

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections