Can Language Models Learn Embeddings of Propositional Logic Assertions? (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing methods for automating reasoning can no longer be used for natural language tasks. |
| Approach: | They propose to use transformer-based language models to reason about knowledge expressed in natural language rather than using LMs to perform reasoning directly. |
| Outcome: | The proposed approach is feasible to some extent, but lacks robustness. |
Similar Papers
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. |
Complex Reasoning in Natural Language (2023.acl-tutorials)
Copied to clipboard
| Challenge: | Recent research shows that pretrained language models are often brittle for complex reasoning tasks. |
| Approach: | They propose to use pre-trained language models to teach machines to reason over texts . they will review recent promising approaches to tackling complex reasoning tasks . |
| Outcome: | This tutorial reviews promising approaches to complex reasoning tasks . it reviews the methods that can be used to augment models with robustness . |
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. |
Logical Transformers: Infusing Logical Structures into Pre-Trained Language Models (2023.findings-acl)
Copied to clipboard
Borui Wang, Qiuyuan Huang, Budhaditya Deb, Aaron Halfaker, Liqun Shao, Daniel McDuff, Ahmed Hassan Awadallah, Dragomir Radev, Jianfeng Gao
| Challenge: | Existing pre-trained language models that ignore the logical structures underlying natural language text often lack the ability to capture and encode key logical information in the input sequences. |
| Approach: | They propose to construct logic-aware input embeddings for transformer language models through logic detection, logic mapping and hierarchical logical projections and then develop a new modeling paradigm that can upgrade existing transformer language model into logical transformers to boost their performance. |
| Outcome: | The proposed model can achieve superior performance on four important and challenging tasks. |
Can LMs Learn New Entities from Descriptions? Challenges in Propagating Injected Knowledge (2023.acl-long)
Copied to clipboard
| Challenge: | Existing methods for updating knowledge show little propagation of injected knowledge. |
| Approach: | They propose to inject individual facts into LMs and evaluate whether they can propagate injected facts while not changing predictions on other contexts. |
| Outcome: | The proposed model can make inferences based on injected facts and propagate them . existing methods show little propagation of injected knowledge . |
Faithful and Robust LLM-Driven Theorem Proving for NLI Explanations (2025.acl-long)
Copied to clipboard
| Challenge: | Recent work has shown that the interaction of large language models (LLMs) with theorem provers (TPs) can help verify and improve the validity of NLI explanations. |
| Approach: | They propose to use logical expressions to guide LLMs in generating structured proof sketches and to use them to improve their accuracy. |
| Outcome: | The proposed strategies improve autoformalisation, syntactic errors and explanation refinement over the state-of-the-art model. |
Teaching Probabilistic Logical Reasoning to Transformers (2024.findings-eacl)
Copied to clipboard
| Challenge: | Existing approaches to reasoning using transformers are limiting, resulting in inconsistent results in arithmetic and QA benchmarks. |
| Approach: | They propose a novel approach that utilizes probabilistic logical rules as constraints in the fine-tuning phase without relying on them in the inference stage. |
| Outcome: | The proposed approach improves the transformer-based language model’s intrinsic reasoning and makes their probabilistic logical reasoning process more explicit and explainable. |
Can Transformers Learn n-gram Language Models? (2024.emnlp-main)
Copied to clipboard
| Challenge: | Existing work has tested transformers' ability to represent formal languages, but language models are not classifiers of strings but rather distributions over them. |
| Approach: | They relate transformers' ability to learn random n-gram language models to ngram language model (LM) they find add- smoothing outperforms transformers on the former, while transformers perform better on the latter . |
| Outcome: | The proposed models outperform classical methods designed to learn n-gram LMs, while transformers perform better on the latter. |
Learning Semantic Structure through First-Order-Logic Translation (2024.findings-emnlp)
Copied to clipboard
| Challenge: | a recent study shows that transformer-based language models can confuse which predicates apply to which objects . a this is a crucial building block of semantic structure, but if an LM mixes up which objects have which property, it makes errors in reasoning . |
| Approach: | They propose to use transformer-based language models to learn predicate argument structure from simple sentences. |
| Outcome: | The proposed model can learn predicate argument structure from simple sentences. |
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. |