REVIEW 2 cited by
Do Large Language Models Understand Logic or Just Mimick Context?
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Over the past few years, the abilities of large language models (LLMs) have received extensive attention, which have performed exceptionally well in complicated scenarios such as logical reasoning and symbolic inference. A significant factor contributing to this progress is the benefit of in-context learning and few-shot prompting. However, the reasons behind the success of such models using contextual reasoning have not been fully explored. Do LLMs have understand logical rules to draw inferences, or do they ``guess'' the answers by learning a type of probabilistic mapping through context? This paper investigates the reasoning capabilities of LLMs on two logical reasoning datasets by using counterfactual methods to replace context text and modify logical concepts. Based on our analysis, it is found that LLMs do not truly understand logical rules; rather, in-context learning has simply enhanced the likelihood of these models arriving at the correct answers. If one alters certain words in the context text or changes the concepts of logical terms, the outputs of LLMs can be significantly disrupted, leading to counter-intuitive responses. This work provides critical insights into the limitations of LLMs, underscoring the need for more robust mechanisms to ensure reliable logical reasoning in LLMs.
Forward citations
Cited by 2 Pith papers
-
ZebraLogic: On the Scaling Limits of LLMs for Logical Reasoning
On 1,000 generated logic grid puzzles, LLM accuracy drops sharply as search-space size and Z3 conflict count grow, and neither larger models, more samples, nor longer reasoning chains fully overcome the drop.
-
StepProof: Step-by-step verification of natural language mathematical proofs
Decomposing natural-language proofs into sentence-level formal subproofs improves autoformalization success rates and efficiency compared with whole-proof formalization.
Discussion (0). Continue with ORCID to comment.