On the Paradox of Learning to Reason from Data
Open accessAbstract
Logical reasoning is needed in a wide range of NLP tasks. Can a BERT model be trained end-to-end to solve logical reasoning problems presented in natural language? We attempt to answer this question in a confined problem space where there exists a set of parameters that perfectly simulates logical reasoning. We make observations that seem to contradict each other: BERT attains near-perfect accuracy on in-distribution test examples while failing to generalize to other data distributions over the exact same problem space. Our study provides an explanation for this paradox: instead of learning to emulate the correct reasoning function, BERT has, in fact, learned statistical features that inherently exist in logical reasoning problems. We also show that it is infeasible to jointly remove statistical features from data, illustrating the difficulty of learning to reason in general. Our result naturally extends to other neural models (e.g. T5) and unveils the fundamental difference between learning to reason and learning to achieve high performance on NLP benchmarks using statistical features.
AI snapshot
Written from the paper’s full text.
TL;DR
BERT can reach near-perfect in-distribution accuracy on a confined logical reasoning problem space, but it fails to generalize across distributions over the same problem space. The paper argues this paradox occurs because BERT learns statistical features inherent to logical reasoning problems rather than emulating the correct reasoning function.
Key findings
- BERT trained and tested on the same sampling distribution achieves near-perfect accuracy: on RP→RP, accuracy ranges from 99.9% at reasoning depth 0 to 95.5% at depth 6; on LP→LP, from 100.0% to 99.0%.
- Cross-distribution generalization fails sharply: RP-trained BERT tested on LP drops from 99.8% at depth 0 to 57.3% at depth 6; LP-trained BERT tested on RP drops from 97.3% to 69.2%.
- Training on a mixture of RP and LP still fails on a slightly different LP* distribution, with accuracy falling to 55.2% at depth 6.
- The paper identifies statistical features such as `#rule`: in RP, `Pr(label=1 | #rule=x) > 0.5` for `x > 40`. Removing `#rule` as a statistical feature improves LP generalization at depth 6 from 57.3% to 68.1%, about 10% higher. Jointly removing multiple statistical features is computationally expensive: balancing `#fact=15` requires `k=5.5`, adding branching factor `[2.65,2.75]` requires `k=20.0`, and adding `#rule=58` requires `k=55.6`.
Methods
- The authors define SimpleLogic, a propositional-logic problem space using definite clauses. Each example is `(facts, rules, query, label)`; `#atom` ranges from 5 to 30 sampled from 150 adjectives, `#rule` from 0 to `4 × #atom`, rule bodies contain 1 to 3 atoms, `#fact` from 1 to `#atom`, and reasoning depth ranges from 0 to 6. Problems are encoded in templated English.
- They prove by construction that BERT has enough capacity to simulate forward chaining and solve SimpleLogic instances of reasoning depth ≤ 10 with 100% accuracy.
- They sample datasets via Rule-Priority (RP) and Label-Priority (LP), 40k examples per reasoning depth from 0 to 6, yielding 280k examples per dataset, then train BERT-base on RP, LP, and mixtures. They also construct RP_balance by down-sampling to remove `#rule` as a statistical feature, and report similar behavior for T5.
Limitations
- The paper does not state an explicit limitations section.
- Evident from the text: the study is confined to SimpleLogic, a simple, finite, templated problem space with no language variance, no prior knowledge, only deductive propositional definite clauses, and limited reasoning depth. The authors note that real NLP reasoning tasks involving prior knowledge and language variance could have even stronger statistical features.
- Evident from the text: removing statistical features is only partially feasible. The paper balances `#rule` only for `0 ≤ x ≤ 80`, covering about 90% of RP examples, and shows that jointly removing multiple statistical features grows the required sampling cost roughly exponentially. Experiments focus on BERT and T5.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
0 of 9 cited sources checked · 0 supported · 0 flagged
- Findingown data
As more statistical features are jointly removed, the conditional probability Pr(label=1|X) becomes more unbalanced.
“As shown in Table 4, as we try to jointly remove more statistical features X, Pr(label = 1|X) becomes more unbalanced”
Quote in the paperSubstantial claim - Findingown data
A reasoning problem's most basic statistic can reveal substantial information about its correct label.
“even the simplest statistic of a reasoning problem can give away significant information about the true label (Sec.4.1)”
- Also stated in: § 4 BERT Learns Statistical Features · plain
“even the simplest statistics of reasoning problems can provide significant information about their labels”
Quote in the paperSubstantial claim - Also stated in: § 4 BERT Learns Statistical Features · plain
- Findingown data
BERT trained on RP balance performs even better on RP than BERT trained on RP.
“As shown in Table 3, BERT trained on RP shows large performance drop when tested on RP balance, while BERT trained on RP balance shows even better performance on RP than RP-trained BERT.”
Quote in the paperSubstantial claim - Findingown data
A BERT model trained on combined RP and LP data performs poorly on LP*, a slightly altered version of LP.
“we observe that the model performance again drops significantly on LP * (Table 2)”
Quote in the paperSubstantial claim - Findingown data
The rule count acts as a statistical feature in the RP dataset.
“Hence, we call #rule a statistical feature for the dataset RP.”
Quote in the paperSubstantial claim
- Findingcitation
T5 shows behavior similar to BERT in this setting.
“This intuition is supported by experiments with T5 [Raffel et al., 2020], which exhibits similar behaviors.”
Quote in the paperNot a substantial claim0 of 1 sources checked- cites Raffel et al., 2020
Not checked in the free run.
- Findingown data
Using only the count of rules in a problem allows better-than-chance prediction of its label.
“by only looking at the number of rules in a reasoning problem, we can predict the correct label better than a random guess.”
- Also stated in: § 4.1 Statistical Features Inherently Exists · hedged
“which makes it possible for the model to guess the label of an example with relatively high accuracy by only using its #rule.”
Quote in the paperSubstantial claim - Also stated in: § 4.1 Statistical Features Inherently Exists · hedged
- Findingnone given
Training BERT yields near-perfect test accuracy on distributions that span the entire problem space.
“(E3) the BERT model can be trained to achieve near-perfect test accuracy on data distributions covering the whole problem space.”
Quote in the paperSubstantial claim - Findingown data
A BERT model trained on combined RP and LP data reaches almost perfect test accuracy.
“We train BERT on the mixture of RP and LP, and BERT again achieves nearly perfect test accuracy.”
Quote in the paperSubstantial claim - Findingown data
As #fact, branching factor, and #rule are progressively removed, the minimum sampling multiplier grows roughly exponentially: 5.5, 20.0, 55.6.
“in particular, as we progressively remove #fact, branching factor and #rule, the minimum times of examples we need to sample grows roughly exponentially: 5.5 → 20.0 → 55.6.”
Quote in the paperSubstantial claim - Findingown data
T5 generalizes better after #rule is removed from RP.
“the T5 model generalizes better after #rule is removed from RP, suggesting that it is using #rule to make predictions.”
Quote in the paperSubstantial claim - Findingown data
BERT trained on RP balance achieves higher accuracy on LP than BERT trained on RP.
“As shown in Table 3, compared to RP-trained BERT, BERT trained on RP balance achieves higher accuracy when tested on LP; in particular, for examples with reasoning depth 6, the model trained on RP balance attains an accuracy of 68.1%, approximately 10% higher than the model trained on RP.”
Quote in the paperSubstantial claim - Findingown data
BERT possesses sufficient capacity to represent the correct reasoning function for SimpleLogic.
“(E2) we prove by construction that the BERT model has enough capacity to represent the correct reasoning function (Sec 2.2)”
- Also stated in: § 2.2 BERT Has Enough Capacity to Solve SimpleLogic · boosted
“we explicitly construct a parameterization for BERT such that the fixed-parameter model solves all problem instances in SimlpleLogic.”
Quote in the paperSubstantial claim - Also stated in: § 2.2 BERT Has Enough Capacity to Solve SimpleLogic · boosted
- Findingown data
LP and the uniform distribution show similar statistical patterns for the rule count.
“In addition to RP, we also verify that both LP and the uniform distribution exhibit similar statistical patterns”
Quote in the paperSubstantial claim - Findingown data
The branching factor serves as a statistical feature in LP and the uniform distribution as well.
“we observe that branching factor is also a statistical feature for both LP and the uniform distribution”
Quote in the paperSubstantial claim - Findingown data
For examples with reasoning depth 6, BERT trained on RP balance attains 68.1% accuracy on LP, about 10% higher than BERT trained on RP.
“As shown in Table 3, compared to RP-trained BERT, BERT trained on RP balance achieves higher accuracy when tested on LP; in particular, for examples with reasoning depth 6, the model trained on RP balance attains an accuracy of 68.1%, approximately 10% higher than the model trained on RP.”
Quote in the paperSubstantial claim - Findingown data
BERT trained on RP shows a large performance drop when tested on RP balance.
“As shown in Table 3, BERT trained on RP shows large performance drop when tested on RP balance, while BERT trained on RP balance shows even better performance on RP than RP-trained BERT.”
Quote in the paperSubstantial claim - Findingown data
Statistical features can impair a model's ability to generalize.
“We show that statistical features can hinder model generalization performance (Sec.4.2)”
Quote in the paperSubstantial claim - Findingreasoning
Uniform sampling is undesirable because more than 99.99% of generated examples would contain 30 atoms and 120 rules.
“over 99.99% of the examples generated by uniform sampling would have 30 atoms and 120 rules.”
Quote in the paperSubstantial claim - Findingown data
Models fail catastrophically on other distributions.
“while models can attain near-perfect test accuracy on training distributions, they fail catastrophically on other distributions”
Quote in the paperSubstantial claim - Findingnone given
Models can attain near-perfect test accuracy on training distributions.
“while models can attain near-perfect test accuracy on training distributions, they fail catastrophically on other distributions”
Quote in the paperSubstantial claim - Findingnone given
90% of the examples in RP have #rule ≤ 80.
“Not balancing the label for x > 80 is acceptable as 90% of the examples in RP have #rule ≤ 80.”
Quote in the paperSubstantial claim - Findingown data
If we naively drop the minimum number of examples from RP to satisfy Equation 1, we will be left with only 339 examples with #rule = 80, while 6822 examples with #rule = 38 remain unchanged.
“if we naively drop the minimum number of examples from RP such that Equation 1 is satisfied, we will be left with only 339 examples with #rule = 80, where the number ( 6822) of examples with #rule = 38 remains unchanged.”
Quote in the paperSubstantial claim - Interpretationreasoning
Powerful neural models can learn to use statistical features to achieve high in-distribution accuracy.
“thus powerful neural models can learn to use them to achieve high in-distribution accuracy”
Quote in the paperSubstantial claim - Interpretationown data
It is computationally infeasible to jointly remove multiple statistical features.
“We show that though removing one statistical feature (e.g., #rule) from training data can benefit model generalization, it is computationally infeasible to jointly remove multiple statistical features.”
Quote in the paperSubstantial claim - Interpretationown data
SimpleLogic can be solved without substantial model capacity.
“Solving SimpleLogic does not require significant model capacity.”
Quote in the paperSubstantial claim - Interpretationreasoning
Jointly removing statistical features from data is not feasible.
“We also show that it is infeasible to jointly remove statistical features from data, illustrating the difficulty of learning to reason in general.”
- Also stated in: § 1 Introduction · hedged
“we argue that there are potentially countless statistical features and it is computationally expensive to jointly remove them from data (Sec.4.3).”
Quote in the paperSubstantial claim - Also stated in: § 1 Introduction · hedged
- Interpretationreasoning
Identifying every statistical feature is not feasible.
“Thus, it is infeasible to identify all of them.”
Quote in the paperNot a substantial claim - Interpretationreasoning
Statistical features can be compositional, formed by combining several features, which increases their complexity.
“statistical features can also be compositional: one can define a joint statistical feature by combining multiple ones (e.g., branching factor and #rule), which further adds to the complexity.”
Quote in the paperSubstantial claim - Premisenone given
The SimpleLogic problem space is limited and simple.
“our problem space is confined and simple (see E1, E2)”
Quote in the paperSubstantial claim - Interpretationreasoning
BERT learned statistical features inherent in logical reasoning problems rather than emulating the correct reasoning function.
“instead of learning to emulate the correct reasoning function, BERT has, in fact, learned statistical features that inherently exist in logical reasoning problems.”
- Also stated in: § 1 Introduction · plain
“the model has learned to use statistical features in logical reasoning problems to make predictions rather than to emulate the correct reasoning function.”
Quote in the paperSubstantial claim - Also stated in: § 1 Introduction · plain
- Interpretationreasoning
A model that relies on statistical features to make predictions does not generalize to out-of-distribution examples.
“the model that relies on statistical features to make predictions does not generalize to out-of-distribution examples”
Quote in the paperSubstantial claim- Rests on an assumption: Correlations between statistical features and labels can change when the data distribution changes.
- Interpretationnone given
In contrast to shallow shortcuts in typical NLP tasks, logical reasoning's statistical features can be numerous and highly complex, making them hard to remove from training data.
“unlike the shallow shortcuts found in other typical NLP tasks, such statistical features can be countless and extremely complicated, and thus very difficult to be removed from training data.”
Quote in the paperSubstantial claim - Interpretationown data
Removing #rule as a statistical feature improves model generalization.
“This is a clear signal that when #rule is removed as a statistical feature, the model generalizes better, suggesting that statistical features can hinder the generalization of the model.”
Quote in the paperSubstantial claim - Interpretationreasoning
The paper's conclusions should also hold for other neural models.
“More importantly, as our argument assumes little about model architectures/pre-training procedures, most of our conclusions should also hold for other neural models.”
Quote in the paperSubstantial claim- The authors state this as an assumption: The paper's argument does not depend much on specific model architectures or pre-training procedures.
- Interpretationreasoning
A model that performs well only on in-distribution examples has not acquired reasoning.
“the model attaining high accuracy only on indistribution test examples has not learned to reason.”
- Also stated in: § 1 Introduction · plain
“Since the correct reasoning function does not change across data distributions, it follows that the model has not learned to reason.”
Quote in the paperSubstantial claim- Rests on an assumption: The correct reasoning function remains the same across data distributions.
- Also stated in: § 1 Introduction · plain
- Interpretationreasoning
The observed failure is not a typical out-of-distribution generalization failure.
“What we observed is not a common case of out-of-distribution (OOD) generalization failure”
Quote in the paperSubstantial claim - Interpretationown data
T5 uses #rule to make predictions.
“the T5 model generalizes better after #rule is removed from RP, suggesting that it is using #rule to make predictions.”
Quote in the paperSubstantial claim - Interpretationreasoning
These statistical patterns should appear naturally in any non-adversarially constructed dataset.
“Since this intuition assumes nothing about data distributions, it follows that such statistical patterns should naturally exist in any dataset that is not adversarially constructed.”
Quote in the paperSubstantial claim - Interpretationreasoning
Statistical features belong to logical reasoning problems generally, rather than to particular data distributions.
“statistical features still inherently exist and are not specific to certain data distributions.”
- Also stated in: § Statistical Features are Inherent to Logical Reasoning · boosted
“we show that #rule inherently exists as a statistical feature for logical reasoning problems in general; that is, it is not specific to the RP dataset.”
Quote in the paperSubstantial claim - Also stated in: § Statistical Features are Inherent to Logical Reasoning · boosted
- Interpretationcitation
The findings extend to other neural models such as T5.
“Our result naturally extends to other neural models (e.g.T5)”
- Also stated in: § 1 Introduction · plain
“This intuition is supported by experiments with T5 [Raffel et al., 2020], which exhibits similar behaviors.”
Quote in the paperNot a substantial claim0 of 1 sources checked- cites Raffel et al., 2020
Not checked in the free run.
- Also stated in: § 1 Introduction · plain
- Interpretationreasoning
The rule count is inherently a statistical feature of logical reasoning problems generally, not only of RP.
“we show that #rule inherently exists as a statistical feature for logical reasoning problems in general; that is, it is not specific to the RP dataset.”
Quote in the paperSubstantial claim - Interpretationreasoning
The number of facts is also positively associated with labels.
“as facts can be seen as special form of rules, it follows from previous argument that #fact is also positively correlated with labels.”
Quote in the paperNot a substantial claim - Interpretationreasoning
Rules with three body atoms are less likely to fire than rules with one body atom.
“rules of the form A, B, C → D are less likely to be”
Quote in the paperSubstantial claim - Interpretationreasoning
With fixed atoms and facts, adding more rules makes any atom more likely to be proved, so Pr(label=1 | #rule=x) should rise roughly monotonically with x.
“given a fixed set of atoms and facts, any atom is more likely to be proved when more rules are given, that is, Pr(label(e) = 1 | #rule(e) = x) should increase roughly monotonically as x increases.”
Quote in the paperSubstantial claim - Interpretationreasoning
A problem's average rule-body size can reveal information about its label.
“the average number of atoms in rules of a reasoning problem can also leak information about its label.”
Quote in the paperNot a substantial claim - Interpretationown data
Statistical features can hinder the generalization of the model.
“This is a clear signal that when #rule is removed as a statistical feature, the model generalizes better, suggesting that statistical features can hinder the generalization of the model.”
Quote in the paperSubstantial claim - Interpretationreasoning
Learning to reason differs fundamentally from achieving high NLP benchmark scores through statistical features.
“Our findings unveil the fundamental difference between”
Quote in the paperSubstantial claim - Interpretationown data
The model appears to imitate a flawed reasoning function tied to its training distribution.
“the model seems to be emulating an incorrect”
Quote in the paperSubstantial claim - Interpretationown data
No evidence indicates that continually enriching the training distribution will transform the model into one that learns reasoning.
“we find no evidence that consistently enriching the training distribution will bring a transformative change such that the model can learn to reason.”
Quote in the paperSubstantial claim - Interpretationreasoning
The accuracy drop from RP to RP balance indicates that BERT trained on RP uses #rule to make predictions.
“Since RP balance is down-sampled from RP, the accuracy drop from RP to RP balance is explained by that BERT trained on RP is using #rule to make predictions.”
Quote in the paperSubstantial claim - Interpretationown data
Models have learned to exploit statistical features rather than to emulate the correct reasoning function.
“we demonstrate that they have learned to exploit statistical features rather than to emulate the correct reasoning function.”
Quote in the paperSubstantial claim - Interpretationreasoning
Training on datasets might not be sufficient for models to learn certain complex behaviors such as reasoning and planning.
“Our study suggests that training on datasets might not be sufficient for model to learn certain complex behaviors such as reasoning and planning.”
Quote in the paperSubstantial claim
- Classified as probably not a substantial claim. 5
- May combine two claims. 15
Probably not a substantial claim: may not pass S4 (based).
Findingnone given§ On the Paradox of Learning to Reason from DataThe constructed BERT achieves perfect accuracy on all SimpleLogic instances with reasoning depth up to 10.
“the”
Quote in the paperNot a substantial claimMay combine two claims.
Findingown dataBERT achieves near-perfect accuracy on in-distribution test examples but does not generalize to other data distributions within the same problem space.
“BERT attains near-perfect accuracy on in-distribution test examples while failing to generalize to other data distributions over the exact same problem space.”
- Also stated in: § 1 Introduction · plain
“the models attaining near-perfect accuracy on one data distribution do not generalize to other distributions within the same problem space (Sec.3).”
- Also stated in: § BERT Performs Well on Training Distributions · plain
“the BERT model trained on RP fails drastically on LP, and vice versa.”
Quote in the paperSubstantial claim- Also stated in: § 1 Introduction · plain
May combine two claims.
Findingown dataA higher branching factor makes a positive example less likely, as verified for RP.
“Our intuition suggests that the larger the branching factor, the less likely an example will be positive; we verify that this intuition holds for RP, as shown in Figure 5.”
Quote in the paperNot a substantial claimMay combine two claims.
Findingown dataIn RP, the rule count correlates strongly with labels: above 40 rules, positive examples exceed half by wide margins, with Pr(label=1 | #rule=x) > 0.5 for x > 40.
“the #rule for reasoning problems in RP exhibit a strong correlation with their labels: when #rule > 40, the number of positive examples exceeds 50% by large margins; formally, Pr e∼RP (label(e) = 1 | #rule(e) = x) > 0.5 for x > 40”
Quote in the paperSubstantial claimMay combine two claims.
FindingcitationT5 attains near-perfect accuracy on the training distribution but fails catastrophically on other distributions.
“the T5 model attaining near-perfect accuracy on the training distribution fails catastrophically on the other distributions”
Quote in the paperSubstantial claim0 of 1 sources checked- cites Raffel et al., 2020
Not checked in the free run.
May combine two claims.
Findingown dataA rough estimation shows that balancing Pr(label=1|#rule=x) for x up to 110 would require ratio k > 100, over 100x running time (200 hours on a 40-core CPU) to pre-sample roughly 56 million examples.
“A rough estimation shows that if we were to balance Pr e∼RP (label(e) = 1 | #rule(e) = x) for x up to 110, the ratio k > 100, that is, we need to spend over 100x running time (200 hours on a 40-core CPU) to pre-sample roughly 56 million examples”
Quote in the paperSubstantial claimProbably not a substantial claim: may not pass S3 (load-bearing), S4 (based). May combine two claims.
Study design and conductnone givenThe RP and LP sampling methods are general and span the entire problem space.
“Both LP and RP are general, and they cover the whole problem space.”
Quote in the paperNot a substantial claimMay combine two claims.
InterpretationreasoningPotentially innumerable statistical features exist, and removing them all from data is computationally costly.
“we argue that there are potentially countless statistical features and it is computationally expensive to jointly remove them from data (Sec.4.3).”
- Also stated in: § 4 BERT Learns Statistical Features · plain
“such statistical features can be countless and extremely complicated, and thus very difficult to be removed from training data.”
Quote in the paperSubstantial claim- Also stated in: § 4 BERT Learns Statistical Features · plain
May combine two claims.
Interpretationown dataThe combination of multiple statistical features can give stronger signal about the label than individual features, making joint removal harder.
“The combination of multiple statistical features can give stronger signal about the label than the individual ones; thus it is even harder to jointly remove them.”
Quote in the paperSubstantial claimMay combine two claims.
Interpretationown dataThe argument makes few assumptions about architecture and carries over to other neural models.
“our argument assumes little about model architecture and naturally extends to other neural models.”
Quote in the paperSubstantial claimProbably not a substantial claim: may not pass S2 (checkable), S4 (based).
Interpretationnone givenStatistical features can be arbitrarily complex.
“as we have discussed in Section 4.1, statistical features can be arbitrarily complex”
Quote in the paperNot a substantial claimMay combine two claims.
PremisecitationOOD generalization discussions commonly concern open problem spaces and mismatched training and testing domains.
“discussions about OOD generalization often involve open problem spaces [Lin et al., 2019;Gontier et al., 2020;Yin et al., 2020;Wald et al., 2021] and domain mismatch between training and testing distribution [Yin et al., 2021;Koh et al., 2021].”
Quote in the paperSubstantial claim0 of 3 sources checked- cites Lin et al., 2019
Not checked in the free run.
- cites Gontier et al., 2020
Not checked in the free run.
- cites Yin et al., 2020
Not checked in the free run.
May combine two claims.
InterpretationreasoningLearning reasoning from data is hard: models tend to pick up statistical features, and building a logical reasoning dataset free of such features is difficult.
“Our study implies the difficulty of learning to reason from data: while a model always tends to learn statistical features, it is difficult to construct a logical reasoning dataset with no statistical features.”
Quote in the paperSubstantial claimMay combine two claims.
InterpretationreasoningTraining BERT on data containing statistical features leads it to predict from those features instead of the correct reasoning function, so it does not generalize across the problem space.
“When BERT is trained on data with statistical features, it tends to make predictions based on such features rather than learning to emulate the correct reasoning function; thus, BERT fails to generalize to the whole problem space.”
Quote in the paperSubstantial claimMay combine two claims.
Study design and conductnone givenProblem-space examples test only reasoning ability, lacking language variation and requiring no prior knowledge.
“(E1) examples in the problem space only test model's reasoning ability: they have no language variance and require no prior knowledge”
Quote in the paperSubstantial claimProbably not a substantial claim: may not pass S2 (checkable).
InterpretationreasoningSome statistical features may be too complex for humans to construct manually.
“it is not hard to imagine that some statistical features can be so complex that they cannot even be manually constructed by humans.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
InterpretationreasoningFor some other settings, the conditional probability can be more unbalanced, requiring even more pre-sampling.
“for some other settings, the conditional probability can be more unbalanced, requiring us to pre-sample even more examples.”
Quote in the paperNot a substantial claimMay combine two claims.
PremisecitationMost prior studies focus on solving a single task, and their datasets are either designed for a specific domain or have confounding factors such as language variance, so they cannot be used to strictly or comprehensively study logical reasoning abilities of models.
“However, most studies focus on solving a single task, and the datasets are either designed for a specific domain [Johnson et al., 2017;Sinha et al., 2019], or have confounding factors such as language variance [Yu et al., 2020]; they cannot be used to strictly or comprehensively study the logical reasoning abilities of models.”
Quote in the paperSubstantial claim0 of 3 sources checked- cites Johnson et al., 2017
Not checked in the free run.
- cites Sinha et al., 2019
Not checked in the free run.
- cites Yu et al., 2020
Not checked in the free run.
May combine two claims.
Interpretationown dataThis could be a serious issue in terms of dataset coverage: examples with some particular #rule will dominate D′ and there will not be enough examples for other #rule.
“This could be a serious issue in terms of dataset coverage: examples with some particular #rule will dominate D ′ and there will not be enough examples for other #rule.”
Quote in the paperSubstantial claim
The paper relies on this without support.
The correct reasoning function remains the same across data distributions.
“Since the correct reasoning function does not change across data distributions, it follows that the model has not learned to reason.”
The authors state this as an assumption.
The paper's argument does not depend much on specific model architectures or pre-training procedures.
“as our argument assumes little about model architectures/pre-training procedures”
The paper relies on this without support.
Correlations between statistical features and labels can change when the data distribution changes.
“since the correlations between statistical features and labels can change as the data distribution changes”
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
LLMs may be biased toward surface-level correlations reinforced during training, which perform well on in-distribution data but hinder the development of generalizable reasoning strategies, leaving them vulnerable to the Einstellung effect.
“Consequently, LLMs may be biased toward surface-level correlations reinforced during training, which perform well on in-distribution data but hinder the development of generalizable reasoning strategies59, leaving them vulnerable to the Einstellung effect53.”
From Limitations of large language models in clinical problem-solving arising from inflexible reasoning (2025) · cites this paper as [59]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
Each contradiction between two passages listed here was confirmed by an independent check.
Rule-Priority cannot sample every SimpleLogic instance
MinorSimpleLogic permits examples with zero rules, but Rule-Priority samples the number of rules starting at one. Thus Rule-Priority cannot cover the whole problem space as claimed.
“Both LP and RP are general, and they cover the whole problem space.”
“In Rule-Priority, we first randomly sample #atom, #fact and #rule uniformly at random from [5, 30], [1, #atom] and [1, 4 × #atom] respectively”
Cites
Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A. N., Kaiser, L., & Polosukhin, I. (2017) · arXiv · doi:10.48550/arxiv.1706.03762 · Cited by 120,404 · see citing works
Jakubův, J., Chvalovský, K., Goertzel, Z., et al. (2023) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.itp.2023.19 · Cited by 76,648 · see citing works
Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformer
Raffel, C., Shazeer, N., Roberts, A., Lee, K., Narang, S., Matena, M., Zhou, Y., Li, W., & Liu, P. J. (2019) · arXiv · doi:10.48550/arxiv.1910.10683 · Cited by 10,929 · see citing works
The complexity of theorem-proving procedures
Cook, S. A. (1971) · Proceedings of the third annual ACM symposium on Theory of computing - STOC '71 · doi:10.1145/800157.805047 · Cited by 6,385 · see citing works
SQuAD: 100,000+ Questions for Machine Comprehension of Text
Rajpurkar, P., Zhang, J., Lopyrev, K., & Liang, P. (2016) · Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/d16-1264 · Cited by 6,208 · see citing works
Learning Word Vectors for Sentiment Analysis
Maas, A. L., Daly, R. E., Pham, P. T., Huang, D., Ng, A. Y., & Potts, C. (2011) · Cited by 3,710 · see citing works
A large annotated corpus for learning natural language inference
Bowman, S. R., Angeli, G., Potts, C., & Manning, C. D. (2015) · Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/d15-1075 · Cited by 3,377 · see citing works
A Broad-Coverage Challenge Corpus for Sentence Understanding through Inference
Williams, A., Nangia, N., & Bowman, S. (2018) · Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long Papers) · doi:10.18653/v1/n18-1101 · Cited by 3,342 · see citing works
Torralba, A., & Efros, A. A. (2011) · CVPR 2011 · doi:10.1109/cvpr.2011.5995347 · Cited by 2,440 · see citing works
HotpotQA: A Dataset for Diverse, Explainable Multi-hop Question Answering
Yang, Z., Qi, P., Zhang, S., Bengio, Y., Cohen, W., Salakhutdinov, R., & Manning, C. D. (2018) · Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/d18-1259 · Cited by 1,804 · see citing works
CLEVR: A Diagnostic Dataset for Compositional Language and Elementary Visual Reasoning
Johnson, J., Hariharan, B., van der Maaten, L., Fei-Fei, L., Zitnick, C. L., & Girshick, R. (2017) · 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2017.215 · Cited by 1,781 · see citing works
Right for the Wrong Reasons: Diagnosing Syntactic Heuristics in Natural Language Inference
McCoy, R. T., Pavlick, E., & Linzen, T. (2019) · Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics · doi:10.18653/v1/p19-1334 · Cited by 944 · see citing works
Annotation Artifacts in Natural Language Inference Data
Gururangan, S., Swayamdipta, S., Levy, O., Schwartz, R., Bowman, S., & Smith, N. A. (2018) · Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 2 (Short Papers) · doi:10.18653/v1/n18-2017 · Cited by 907 · see citing works
SWAG: A Large-Scale Adversarial Dataset for Grounded Commonsense Inference
Zellers, R., Bisk, Y., Schwartz, R., & Choi, Y. (2018) · Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.18653/v1/d18-1009 · Cited by 712 · see citing works
Darwiche, A., & Marquis, P. (2002) · Cited by 602 · see citing works
WILDS: A Benchmark of in-the-Wild Distribution Shifts
Koh, P. W., Sagawa, S., Marklund, H., Xie, S. M., Zhang, M., Balsubramani, A., Hu, W., Yasunaga, M., Phillips, R. L., Gao, I., et al. (2020) · arXiv · doi:10.48550/arxiv.2012.07421 · Cited by 518 · see citing works
Don’t Take the Easy Way Out: Ensemble Based Methods for Avoiding Known Dataset Biases
Clark, C., Yatskar, M., & Zettlemoyer, L. (2019) · Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP) · doi:10.18653/v1/d19-1418 · Cited by 381 · see citing works
CommonsenseQA: A Question Answering Challenge Targeting Commonsense KnowledgePreprint
Talmor, A., Herzig, J., Lourie, N., & Berant, J. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1811.00937 · Cited by 296 · see citing works
Analysing Mathematical Reasoning Abilities of Neural Models
Saxton, D., Grefenstette, E., Hill, F., & Kohli, P. (2019) · arXiv · doi:10.48550/arxiv.1904.01557 · Cited by 241 · see citing works
Learning a SAT Solver from Single-Bit SupervisionPreprint
Selsam, D., Lamm, M., Bünz, B., Liang, P., de Moura, L., & Dill, D. L. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1802.03685 · Cited by 213 · see citing works
LogiQA: A Challenge Dataset for Machine Reading Comprehension with Logical Reasoning
Jian, L., Cui, L., Liu, H., Huang, D., Wang, Y., & Zhang, Y. (2020) · International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2020/501 · Cited by 209 · see citing works
ReClor: A Reading Comprehension Dataset Requiring Logical ReasoningPreprint
Yu, W., Jiang, Z., Dong, Y., & Feng, J. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2002.04326 · Cited by 179 · see citing works
Transformers as Soft Reasoners over Language
Clark, P., Tafjord, O., & Richardson, K. (2020) · Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2020/537 · Cited by 176 · see citing works
Unlearn Dataset Bias in Natural Language Inference by Fitting the Residual
He, H., Zha, S., & Wang, H. (2019) · Workshop on Deep Learning Approaches for Low-Resource NLP (DeepLo) · doi:10.18653/v1/d19-6115 · Cited by 153 · see citing works
CLUTRR: A Diagnostic Benchmark for Inductive Reasoning from Text
Sinha, K., Sodhani, S., Dong, J., Pineau, J., & Hamilton, W. L. (2019) · Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP) · doi:10.18653/v1/d19-1458 · Cited by 110 · see citing works
What Can Neural Networks Reason About?Preprint
Xu, K., Li, J., Zhang, M., Du, S. S., Kawarabayashi, K., & Jegelka, S. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1905.13211 · Cited by 107 · see citing works
Reasoning Over Paragraph Effects in Situations
Lin, K., Tafjord, O., Clark, P. E., & Gardner, M. (2019) · Workshop on Machine Reading for Question Answering (MRQA) · doi:10.18653/v1/d19-5808 · Cited by 92 · see citing works
SATNet: Bridging deep learning and logical reasoning using a differentiable satisfiability solverPreprint
Wang, P.-W., Donti, P. L., Wilder, B., & Kolter, J. Z. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1905.12149 · Cited by 85 · see citing works
Broaden the Vision: Geo-Diverse Visual Commonsense Reasoning
Yin, D., Li, L. H., Hu, Z.-N., Peng, N., & Chang, K.-W. (2021) · Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/2021.emnlp-main.162 · Cited by 78 · see citing works
Self-citationOn Calibration and Out-of-domain GeneralizationPreprint
Wald, Y., Feder, A., Greenfeld, D., & Shalit, U. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2102.10395 · Cited by 59 · see citing works
Measuring Systematic Generalization in Neural Proof Generation with TransformersPreprint
Gontier, N., Sinha, K., Reddy, S., & Pal, C. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2009.14786 · Cited by 37 · see citing works
Elazar, Y., Zhang, H., Goldberg, Y., & Roth, D. (2021) · Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.18653/v1/2021.emnlp-main.819 · Cited by 34 · see citing works
Self-citationOn the Robustness of Language Encoders against Grammatical Errors
Yin, F., Long, Q., Meng, T., & Chang, K.-W. (2020) · Proceedings of the conference - Association for Computational Linguistics. Meeting · doi:10.18653/v1/2020.acl-main.310 · Cited by 31 · see citing works
Self-citationNaturalProofs: Mathematical Theorem Proving in Natural LanguagePreprint
Welleck, S., Liu, J., Bras, R. J. L., Hajishirzi, H., Choi, Y., & Cho, K. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2104.01112 · Cited by 25 · see citing works
Diagnosing the First-Order Logical Reasoning Ability Through LogicNLI
Tian, J., Li, Y., Chen, W., Xiao, L., He, H., & Jin, Y. (2021) · Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.18653/v1/2021.emnlp-main.303 · Cited by 24 · see citing works
Improving Graph Neural Network Representations of Logical Formulae with Subgraph PoolingPreprint
Crouse, M., Abdelaziz, I., Cornelio, C., Thost, V., Wu, L., Forbus, K. D., & Fokoue, A. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1911.06904 · Cited by 22 · see citing works
Reasoning Over Paragraph Effects in SituationsPreprint
Lin, K., Tafjord, O., Clark, P. E., et al. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1908.05852 · Cited by 6 · see citing works
An Experimental Study of Formula Embeddings for Automated Theorem Proving in First-Order LogicPreprint
Abdelaziz, I., Thost, V., Crouse, M., & Fokoue, A. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2002.00423 · Cited by 3 · see citing works
Elazar, Y., Zhang, H., Goldberg, Y., et al. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2104.08161 · Cited by 1 · see citing works
Self-citationBERT: Pre-training of Deep Bidirectional Transformers for Language Understanding
Devlin, J., Chang, M.-W., Lee, K., & Toutanova, K. (2018) · arXiv · doi:10.48550/arxiv.1810.04805
Flagged first, then by citations
Research works printed but not linked: 5
- Nicolas Gontier, Koustuv Sinha, Siva Reddy, and Chris Pal. Measuring systematic gen- eralization in neural proof generation with transform- ers. Advances in Neural Information Processing Systems, 33:22231-22242, 2020.
- Christopher Hahn, Frederik Schmitt, Jens U. Kreber, Markus Norman Rabe, and Bernd Finkbeiner. Teaching temporal logics to neural networks. In ICLR. OpenReview.net, 2021.
- Khardon and Roth, 1997] Roni Khardon and Dan Roth. Learning to reason. Journal of the ACM (JACM), 44(5):697-725, 1997.
- Lample and Charton, 2020] Guillaume Lample and Franc ¸ois Charton. Deep learning for symbolic mathemat- ics. In ICLR. OpenReview.net, 2020.
- Alon Talmor, Oyvind Tafjord, Peter Clark, Yoav Goldberg, and Jonathan Berant. Leap-of- thought: Teaching pre-trained models to systematically reason over implicit knowledge. Advances in Neural In- formation Processing Systems, 33:20227-20237, 2020.
Cited by
Sorted by citations
Dissociating language and thought in large language models
Mahowald, K., Ivanova, A. A., Blank, I. A., Kanwisher, N., Tenenbaum, J. B., & Fedorenko, E. (2024) · Trends in Cognitive Sciences · doi:10.1016/j.tics.2024.01.011 · Cited by 345 · see citing works
Generative AI in innovation and marketing processes: A roadmap of research opportunities
Cillo, P., & Rubera, G. (2024) · Journal of the Academy of Marketing Science · doi:10.1007/s11747-024-01044-7 · Cited by 219 · see citing works
Krenn, M., Buffoni, L., Coutinho, B. C., Eppel, S., Foster, J. G., Gritsevskiy, A., Lee, H., Lu, Y., Moutinho, J. P., Sanjabi, N., et al. (2023) · Nature Machine Intelligence · doi:10.1038/s42256-023-00735-0 · Cited by 96 · see citing works
Limitations of large language models in clinical problem-solving arising from inflexible reasoning
Kim, J., Podlasek, A., Shidara, K., Liu, F., Alaa, A., & Bernardo, D. (2025) · Scientific Reports · doi:10.1038/s41598-025-22940-0 · Cited by 78 · see citing works
Natural Language Reasoning, A Survey
Yu, F., Zhang, H., Tiwari, P., & Wang, B. (2024) · ACM Computing Surveys · doi:10.1145/3664194 · Cited by 78 · see citing works
Self-citationHuppertz, M., Siepmann, R. M., Topp, D., Nikoubashman, O., Yüksel, C., Kuhl, C. K., Truhn, D., & Nebelung, S. (2024) · European Radiology · doi:10.1007/s00330-024-11115-6 · Cited by 65 · see citing works
Learning to Prompt in the Classroom to Understand AI Limits: A Pilot Study
Theophilou, E., Koyutürk, C., Yavari, M., Bursic, S., Donabauer, G., Telari, A., Testa, A., Boiano, R., Hernandez-Leo, D., Ruskov, M., et al. (2023) · Lecture Notes in Computer Science · doi:10.1007/978-3-031-47546-7_33 · Cited by 58 · see citing works
GSM-Symbolic: Understanding the Limitations of Mathematical Reasoning in Large Language Models
Mirzadeh, I., Alizadeh, K., Shahrokhi, H., Tuzel, O., Bengio, S., & Farajtabar, M. (2024) · arXiv · doi:10.48550/arxiv.2410.05229 · Cited by 57 · see citing works
Yiu, E., Kosoy, E., & Alison Gopnik, C. (2023) · Perspectives on Psychological Science · doi:10.1177/17456916231201401 · Cited by 61 · see citing works
LAMBADA: Backward Chaining for Automated Reasoning in Natural Language
Kazemi, M., Kim, N., Bhatia, D. S., Xu, X., & Ramachandran, D. (2023) · Proceedings of the conference - Association for Computational Linguistics. Meeting · doi:10.18653/v1/2023.acl-long.361 · Cited by 34 · see citing works
Demystifying Chains, Trees, and Graphs of Thoughts
Besta, M., Memedi, F., Zhang, Z., Gerstenberger, R., Piao, G., Blach, N., Nyczyk, P., Copik, M., Kwaśniewski, G., Müller, J., et al. (2025) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2025.3598182 · Cited by 34 · see citing works
Natural Language Deduction through Search over Statement Compositions
Bostrom, K., Sprague, Z., Chaudhuri, S., & Durrett, G. (2022) · Findings of the Association for Computational Linguistics: EMNLP (Findings of EMNLP) · doi:10.18653/v1/2022.findings-emnlp.358 · Cited by 20 · see citing works
The bewitching AI: The Illusion of Communication with Large Language Models
Bottazzi Grifoni, E., & Ferrario, R. (2025) · Philosophy & Technology · doi:10.1007/s13347-025-00893-6 · Cited by 15 · see citing works
Harnessing the Power of Large Language Models for Automated Code Generation and Verification
Antero, U., Blanco, F. O., Oñativia, J., Sallé, D., & Sierra, B. (2024) · Robotics · doi:10.3390/robotics13090137 · Cited by 12 · see citing works
Fodor, J., Deyne, S. D., & Suzuki, S. (2024) · Computational Linguistics · doi:10.1162/coli_a_00536 · Cited by 14 · see citing works
Walter, Y. (2023) · AI and Ethics · doi:10.1007/s43681-023-00276-7 · Cited by 11 · see citing works
MindGames: Targeting Theory of Mind in Large Language Models with Dynamic Epistemic Modal Logic
Sileo, D., & Lernould, A. (2023) · Findings of the Association for Computational Linguistics: EMNLP (Findings of EMNLP) · doi:10.18653/v1/2023.findings-emnlp.303 · Cited by 10 · see citing works
Han, Z., Battaglia, F., Mansuria, K., Heyman, Y., & Terlecky, S. R. (2025) · AI · doi:10.3390/ai6010012 · Cited by 9 · see citing works
MindMap: Constructing Evidence Chains for Multi-Step Reasoning in Large Language Models
Wu, Y., Han, X., Song, W., Cheng, M., & Li, F. (2024) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v38i17.29896 · Cited by 8 · see citing works
Explicit Planning Helps Language Models in Logical Reasoning
Zhao, H., Wang, K., Yu, M., & Mei, H. (2023) · Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.18653/v1/2023.emnlp-main.688 · Cited by 11 · see citing works
Silveira, I. C., Barbosa, A., da Costa, D. S. L., & Mauá, D. D. (2025) · Lecture notes in computer science · doi:10.1007/978-3-031-79032-4_12 · Cited by 7 · see citing works
GPT-3 Models are Few-Shot Financial Reasoners
de Padua, R. S., Qureshi, I., & Karakaplan, M. U. (2023) · doi:10.5121/csit.2023.131216 · Cited by 7 · see citing works
RobustLR: A Diagnostic Benchmark for Evaluating Logical Robustness of Deductive Reasoners
Sanyal, S., Liao, Z., & Ren, X. (2022) · Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.18653/v1/2022.emnlp-main.653 · Cited by 11 · see citing works
A Simple, Yet Effective Approach to Finding Biases in Code Generation
Mouselinos, S., Malinowski, M., & Michalewski, H. (2023) · Findings of the Association for Computational Linguistics: ACL (Findings of ACL) · doi:10.18653/v1/2023.findings-acl.718 · Cited by 8 · see citing works
LLM-Driven Knowledge Extraction in Temporal and Description Logics
Duranti, D., Giorgini, P., Mazzullo, A., Robol, M., & Roveri, M. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-77792-9_12 · Cited by 6 · see citing works
Model Checking Using Large Language Models—Evaluation and Future Directions
Batsakis, S., Tachmazidis, I., Mantle, M., Papadakis, N., & Antoniou, G. (2025) · Electronics · doi:10.3390/electronics14020401 · Cited by 5 · see citing works
APOLLO: A Simple Approach for Adaptive Pretraining of Language Models for Logical Reasoning
Sanyal, S., Yi‐chong, X., Wang, S., Yang, Z., Pryzant, R., Yu, W., Zhu, C., & Ren, X. (2023) · Proceedings of the conference - Association for Computational Linguistics. Meeting · doi:10.18653/v1/2023.acl-long.347 · Cited by 6 · see citing works
You are what you're for: Essentialist categorization in large language modelsPreprint
Zhang, S., She, S., Gerstenberg, T., & Rosé, D. (2023) · doi:10.31234/osf.io/ypw5r · Cited by 5 · see citing works
LLMs and the Logical Space of Reasons
Sambrotta, M. (2025) · Minds and Machines · doi:10.1007/s11023-025-09751-y · Cited by 5 · see citing works
Wicke, P. (2023) · Findings of the Association for Computational Linguistics: ACL (Findings of ACL) · doi:10.18653/v1/2023.findings-acl.302 · Cited by 4 · see citing works
Assessing Logical Reasoning Capabilities of Encoder-Only Transformer Models
Pirozelli, P., José, M. M., Filho, P. D. T. P. D. C., Brandão, A. A. F., & Cozman, F. G. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-71167-1_2 · Cited by 2 · see citing works
Modeling Multiple Adverse Pregnancy Outcomes: Learning from Diverse Data Sources
Mathur, S., Gadekar, V. P., Ramola, R., Wang, P., Thiruvengadam, R., Haas, D. M., Bhatnagar, S., Wadhwa, N., GARBH-Ini Study Group, Predrag Radivojac, A., et al. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-66538-7_29 · Cited by 2 · see citing works
Can Language Models Trained on Written Monologue Learn to Predict Spoken Dialogue?
Umair, M., Mertens, J. B., Warnke, L., & de Ruiter, J. P. (2024) · Cognitive Science · doi:10.1111/cogs.70013 · Cited by 3 · see citing works
Are Large Language Models Good At Fuzzy Reasoning?
Singh, S. (2024) · International Conference on Computational Intelligence and Intelligent Systems (CIIS) · doi:10.1145/3708778.3708779 · Cited by 1 · see citing works
Toward Enhancing Reasoning Capabilities of LLMs: An Approach via Synthetic Logic Corpus
Morishita, T., Morio, G., Yamaguchi, A., & Sogawa, Y. (2025) · Journal of Natural Language Processing · doi:10.5715/jnlp.32.520 · Cited by 1 · see citing works
On the Relevance of Logic for Artificial Intelligence, and the Promise of Neurosymbolic Learning
Belle, V. (2025) · Neurosymbolic Artificial Intelligence · doi:10.1177/29498732251339951 · Cited by 1 · see citing works
Wahidi, M., Rizk, A., & Imad, R. (2025) · IEEE Access · doi:10.1109/access.2025.3589514 · Cited by 1 · see citing works
REMEND: Neural Decompilation for Reverse Engineering Math Equations from Binary Executables
Udeshi, M., Krishnamurthy, P., Karri, R., & Khorrami, F. (2025) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/3749988 · Cited by 1 · see citing works
Can Large Language Models Generate Effective Datasets for Emotion Recognition in Conversations?
Kaplan, B. C., Carneiro, H., & Wermter, S. (2025) · Procedia Computer Science · doi:10.1016/j.procs.2025.07.145 · Cited by 1 · see citing works
AI in Conflict Resolution: Practical Considerations, Opportunities and Challenges
Molak, A. (2025) · Conflict Resolution Quarterly · doi:10.1002/crq.70012 · Cited by 1 · see citing works
Mocanu, I. G., & Belle, V. (2023) · Natural Language Processing Journal · doi:10.1016/j.nlp.2023.100036 · Cited by 1 · see citing works
Transformers in the Service of Description Logic-Based Contexts
Poulis, A., Tsalapati, E., & Koubarakis, M. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-77792-9_20 · Cited by 1 · see citing works
Can Large Language Models Act as Symbolic Reasoners?
Sullivan, R., & Elsayed, N. (2025) · IEEE International Conference on Computing and Machine Intelligence (ICMI) · doi:10.1109/icmi65310.2025.11141039 · Cited by 1 · see citing works
Artificial Intelligence: A Kalam and Sufi PerspectivePreprint
Khalili, A. M. (2023) · Preprints.org · doi:10.20944/preprints202306.0363.v1 · Cited by 1 · see citing works
Beyond Statistical Learning: Exact Learning Is Essential for General Intelligence
György, A., Lattimore, T., Lazić, N., & Szepesvári, C. (2025) · arXiv · doi:10.48550/arxiv.2506.23908
Профессиональное самоопределение как компонент профессионального становления личности
Николаевна, Д. Т., & Николаевна, Ю. С. (2013) · Научное обеспечение системы повышения квалификации кадров
Artificial Intelligence: A Kalam and Sufi PerspectivePreprint
Khalili, A. M. (2023) · Preprints.org · doi:10.20944/preprints202306.0363.v2
Artificial Intelligence: A Kalam and Sufi PerspectivePreprint
Khalili, A. M. (2023) · Preprints.org · doi:10.20944/preprints202306.0363.v3
Withdrawn: Artificial Intelligence: A Kalam and Sufi PerspectivePreprint
Khalili, A. M. (2023) · Preprints.org · doi:10.20944/preprints202306.0363.v4
Artificial Intelligence: A Kalam and Sufi PerspectivePreprint
Khalili, A. (2024) · Preprints.org · doi:10.20944/preprints202306.0363.v6
ChemAlgebra: Algebraic Reasoning on Chemical Reactions
Valenti, A., Bacciu, D., & Vergari, A. (2024) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn60899.2024.10650037
Reasoning in Transformers – Mitigating Spurious Correlations and Reasoning Shortcuts
Enström, D., Kjellberg, V., & Johansson, M. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-71170-1_18
Model Checking with Large Language Models - Initial Experiments and Future Directions
Batsakis, S., Tachmazidis, I., Mantle, M., Papadakis, N., & Antoniou, G. (2024) · International Conference on Information, Intelligence, Systems & Applications (IISA) · doi:10.1109/iisa62523.2024.10786718
Reasoning Capabilities and Invariability of Large Language Models
Raganato, A., Peñaloza, R., Viviani, M., & Pasi, G. (2024) · IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology (WI-IAT) · doi:10.1109/wi-iat62293.2024.00025
A Learning and Reasoning Manifesto
Raedt, L. D., Heintz, F., Kristian Kersting, B., & Marra, G. (2025) · Lecture notes in computer science · doi:10.1007/978-3-032-03028-3_6
Wang, Y., & Chen, Y. (2025) · Lecture notes in computer science · doi:10.1007/978-3-032-11442-6_20
SocraSynth: Adversarial Multi-LLM Reasoning
Chang, E. Y. (2025) · ACM eBooks · doi:10.1145/3749421.3749430
Jung, S., Choi, S.-H., Jeon, G., Cho, M., & Lim, J. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-37574-2_11
Flach, J. M., Moreira, Á., & Lamb, L. C. (2026) · Journal of the Brazilian Computer Society · doi:10.5753/jbcs.2026.6101
BAP-DL: A Deep Learning Approach for Binding Affinity Prediction
Abbassi, O., Kharmoum, N., Ziti, S., Amri, H. E., & Rhalem, W. (2026) · Lecture notes in networks and systems · doi:10.1007/978-3-032-30563-3_44
- Authors
- Zhang, H., Li, L. H., Meng, T., Chang, K.-W., & Van den Broeck, G.
- Affiliations
- University of California, Los Angeles (US)
- University of California, Los Angeles
- Venue
- Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence
- Published
- 2023-08
- Pages
- 3365-3373
- OpenAlex
- W4385767671
- Cited by
- 58
- References
- 38
- Citations by year
- 2026: 3 · 2025: 17 · 2024: 18 · 2023: 17 · 2022: 2 · 2013: 1
- FWCI
- 9.74
- Type
- conference paper
- Language
- en
- Open access
- bronze
- doi.org
- Locations
- International Joint Conference on Artificial Intelligence (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Funders
- National Science Foundation (1956441, 1943641, 1837129)
- Cisco Systems
- Defense Advanced Research Projects Agency
- Samsung
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Topic Modeling
- Physical Sciences › Computer Science › Artificial Intelligence › Logic, Reasoning, and Knowledge
- Physical Sciences › Computer Science › Artificial Intelligence › Natural Language Processing Techniques
- Keywords
- logical reasoning, BERT, statistical features, generalization, natural language reasoning, T5, benchmark performance
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Claims read by deepseek-v4.1-flash under definition version 3 (extract-v3) on 2026-10-07.
Classified by jev-1.13-20260917 (gold-guideline-v0.2) on 2026-10-07.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review