Challenge: AbductionRules is a set of natural language datasets designed to train and test generalisable abduction over natural-language knowledge bases.
Approach: They propose to train and test generalisable abduction over natural-language knowledge bases by using natural language datasets to fine tune pre-trained Transformers.
Outcome: The proposed models learned generalisable abduction techniques but also exploited the structure of the datasets.

Similar Papers

ProofWriter: Generating Implications, Proofs, and Abductive Statements over Natural Language (2021.findings-acl)

Copied to clipboard

Challenge: Recent work shows that transformers can generate both implications of a theory and the natural language proofs that support them.
Approach: They propose a generative model that generates both implications of a theory and natural language proofs that support them.
Outcome: The proposed model generates both implications of a theory and the natural language proofs that support them.
UNcommonsense Reasoning: Abductive Reasoning about Uncommon Situations (2024.naacl-long)

Copied to clipboard

Challenge: Existing work evaluating commonsense reasoning focuses on making inferences about common, everyday situations.
Approach: They propose to use an English language corpus to investigate commonsense reasoning . they characterize performance differences between human explainers and best-performing large language models .
Outcome: The proposed method reduces the loss rate of human-written explanations on commonsense reasoning compared with the vanilla supervised fine-tuning approach .
Can Transformers Reason in Fragments of Natural Language? (2022.emnlp-main)

Copied to clipboard

Challenge: Recent work on natural language inference has identified two strands of research .
Approach: They investigate whether neural networks have acquired logical principles from natural language . they use transformer-based models to detect valid inferences in controlled fragments of natural language.
Outcome: The proposed model overfits to superficial patterns in the data rather than acquiring the logical principles governing reasoning in natural language fragments.
Fundamental Reasoning Paradigms Induce Out-of-Domain Generalization in Language Models (2026.findings-acl)

Copied to clipboard

Challenge: Deduction, induction, and abduction are fundamental reasoning paradigms, core for human logical thinking.
Approach: They propose to use a dataset of symbolic tasks to induce deductive skills into large language models (LLMs) they then use FT to fine-tune models to improve OOD generalization .
Outcome: The proposed approach yields strong generalizability with substantial performance gains (up to 14.60) across realistic out-of-domain tasks.
Developmental Negation Processing in Transformer Language Models (2022.acl-short)

Copied to clipboard

Challenge: Negation is an important construct in language for reasoning over the truth of propositions, garnering interest from philosophy (Horn, 1989) and psycholinguistics (Zwaan, 2012).
Approach: They propose to frame a natural language inference task as a problem and examine how well transformers can process negation categories.
Outcome: The proposed models perform better on certain categories, suggesting clear differences in how they are processed.
Learning Syntax Without Planting Trees: Understanding Hierarchical Generalization in Transformers (2025.tacl-1)

Copied to clipboard

Challenge: Inductive biases in transformers can cause hierarchical generalization without explicitly encoding structural bias.
Approach: They investigate sources of inductive bias in transformer models and their training that could cause such preference for hierarchical generalization.
Outcome: The proposed model can generalize to novel syntactic forms without explicit bias . the proposed model is able to generalize on a dataset with a hierarchical grammar .
On the Ability and Limitations of Transformers to Recognize Formal Languages (2020.emnlp-main)

Copied to clipboard

Challenge: Existing studies on LSTMs have not revealed their ability to model syntactic properties.
Approach: They propose to build a Transformers model for a subclass of counter languages and find that their learning mechanism strongly correlates with their construction.
Outcome: The proposed model generalizes well on counter languages and its learned mechanism correlates with it.
Identifying the limits of transformers when performing model-checking with natural language (2023.eacl-main)

Copied to clipboard

Challenge: Recent studies have focused on transformer models’ ability to perform reasoning on text, but the above question has not been adequately answered.
Approach: They investigated the problem of model-checking with natural language to determine whether transformers can comprehend logical semantics in natural language.
Outcome: The proposed model-checking problem is suited to address this issue but is untouched in natural language inference research.
It is not True that Transformers are Inductive Learners: Probing NLI Models with External Negation (2024.eacl-long)

Copied to clipboard

Challenge: et al., 2017) show that NLI models learn to treat external negation as a distractor . e-learning models fail to inductively learn the role of negation for NLI tasks .
Approach: They propose that models fine-tuned on NLI datasets learn to treat external negation as a distractor, effectively ignoring its presence in hypothesis sentences.
Outcome: The proposed models learn to treat external negation as a distractor, the authors show . they also fail to inductively learn the law of the excluded middle for a single prefix .
Transformers: State-of-the-Art Natural Language Processing (2020.emnlp-demos)

Copied to clipboard

Challenge: Transformers is an open-source library that aims to open up advances in natural language processing to the wider machine learning community.
Approach: they propose an open-source library that aims to open up advances in machine learning to the wider community.
Outcome: Transformers is an open-source library with the goal of opening up these advances to the wider machine learning community.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations