Interpretable NLI with Graphs of Atomic Propositions: What Does Interpretability Cost?
The study builds a fully graph-based natural language inference pipeline in which premise and hypothesis are decomposed into atomic propositions, converted into ConceptNet triples via constrained decoding, and serialised together with a retrieved ConceptNet subgraph for a fine-tuned Qwen3.5-0.8B-Base classifier that never sees the original text; it reaches 89.7% accuracy on SNLI, only 1.9 points below an identically trained text model, matches published RoBERTa-large on ANLI rounds R2 and R3 (48.0% vs. 48.9% and 44.9% vs. 44.4%) while trailing by 16 points on R1, giving an overall gap of 9 to 14 points against its text counterpart, which the authors call the price of interpretability and attribute to representational rather than data limitations.