Learning Proposition-Level Links from Sentence-Level Supervision for Neuro-Symbolic NLI
Read the original on arXiv Computation and Language →The Flow has not summarised this story yet — read it at arXiv Computation and Language.
The Flow has not summarised this story yet — read it at arXiv Computation and Language.
The paper presents a neuro‑symbolic approach for selecting the correct omitted component in enthymemes, extending prior work from missing‑premise to missing‑claim selection. It replaces binary entailment with logical‑resistance scores and introduces the Possible‑World Atom‑Link Formalization (PWAL), which marginalizes over alternative semantic‑link configurations while keeping translated formulae fixed. Experiments on five tasks show that PWAL improves strict accuracy by up to 30.86 percentage points and reduces tie rates significantly, while also providing a transparent trace of each comparison.
arXiv:2607. 19845v1 Announce Type: cross Abstract: This paper introduces Sentence Splitter, a self-supervised framework built upon a T5-based encoder--decoder architecture for uncovering the latent factual structure of natural language sentences.
arXiv:2405.01259v2 Announce Type: replace Abstract: Argumentation is an important cognitive activity that involves the scrutiny of arguments and counterarguments. When given an argument, it is desira...
arXiv:2606. 02837v1 Announce Type: cross Abstract: Accurate translation from Natural Language to First-Order Logic (NL-to-FOL) underpins neurosymbolic AI systems and Natural Language Inference (NLI), making the quality of NL-to-FOL benchmarks essential -- yet these datasets have never been rigorously audited.
The paper investigates whether natural language inference (NLI) can be performed using only interpretable, graph-based representations of evidence. It introduces a pipeline that decomposes sentences into atomic propositions, maps them to ConceptNet triples, and feeds three graphs—premise, hypothesis, and a retrieved ConceptNet subgraph—into a fine‑tuned 0.8‑billion‑parameter language model. On the SNLI dataset the graph‑only model reaches 89.7% accuracy, close to a text‑based baseline, while on ANLI it matches RoBERTa‑large on rounds R2 and R3 but lags on R1, illustrating a trade‑off between interpretability and performance.
arXiv:2609.26610v1 Announce Type: new Abstract: Despite their outstanding performance on many NLP tasks, LLMs face serious challenges related to semantic abstraction. In this study, we are interested...