Cited by 191Topic ModelingLogic, Reasoning, and KnowledgeNatural Language Processing Techniques

Transformers as Soft Reasoners over Language

Open access
Clark, Peter, Tafjord, Oyvind, Richardson, Kyle·2020·Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence

Abstract

Beginning with McCarthy's Advice Taker (1959), AI has pursued the goal of providing a system with explicit, general knowledge and having the system reason over that knowledge. However, expressing the knowledge in a formal (logical or probabilistic) representation has been a major obstacle to this research. This paper investigates a modern approach to this problem where the facts and rules are provided as natural language sentences, thus bypassing a formal representation. We train transformers to reason (or emulate reasoning) over these sentences using synthetically generated data. Our models, that we call RuleTakers, provide the first empirical demonstration that this kind of soft reasoning over language is learnable, can achieve high (99%) accuracy, and generalizes to test data requiring substantially deeper chaining than seen during training (95%+ scores). We also demonstrate that the models transfer well to two hand-authored rulebases, and to rulebases paraphrased into more natural language. These findings are significant as it suggests a new role for transformers, namely as limited "soft theorem provers" operating over explicit theories in language. This in turn suggests new possibilities for explainability, correctability, and counterfactual reasoning in question-answering.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.24963/ijcai.2020/537

Cites

39 of 39 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

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?

  • A model that has learned a robust implementation of the proof-tree tracing algorithm should, in principle, generalize beyond the shallow depths seen in previous benchmarks.

    “This process is algorithmic; a model that has learned a robust implementation of this algorithm should, in principle, generalize beyond the shallow depths seen in previous benchmarks (Clark et al., 2020;Tafjord et al., 2021;Saparov and He, 2023).”

    From Probing for Long-Horizon Deductive Reasoning Capabilities in Language Models with Prolog (2026) · cites this paper as Clark et al., 2020

    Section 4.2 (p. 4) reports that a model trained on problems up to depth 3 generalized to depth-5 problems, supporting the point about reasoning beyond shallower training depths. But Section 2 (p. 2) says the authors impose no structure on the neural reasoning process; the paper does not establish that the model learned a proof-tree tracing algorithm. (LLM, conf=0.82)

    Experimental — accuracy not yet measured
  • The PARARULE-Plus dataset is a large-scale synthetic dataset for multi-step deductive reasoning over natural language, extending the original PARARULE with deeper inference chains.

    “The PARARULE-Plus dataset [24] is a large-scale synthetic dataset for multi-step deductive reasoning over natural language, extending the original PARARULE [32] with deeper inference chains.”

    From PrologMCP: A Standardized Prolog Tool Interface for LLM Agents (2026) · cites this paper as [32]

    Dataset Generation (p. 6) describes a 40,000-question ParaRules dataset with questions at multiple inference depths, supporting the large-scale, multi-step reasoning description. But our copy calls it ParaRules, not ParaRules-Plus, and does not describe a Plus dataset extending an original with deeper inference chains. Section 4.4 (p. 6) also cautions that its paraphrased rules do not test arbitrary natural language. (LLM, conf=0.84)

    Experimental — accuracy not yet measured
  • Unlike synthetically templated logic datasets, NLR problems have explicit statements along with implicit information that must be inferred from common sense and context.

    “Unlike synthetically templated logic datasets (Han et al., 2022;Clark et al., 2020) in which all premises are stated as short clauses, NLR problems have explicit statements along with implicit information that must be inferred from common sense and context.”

    From Reliable Reasoning Beyond Natural Language (2024) · cites this paper as Clark et al., 2020

  • Navigate, like many other benchmark datasets such as RuleTaker, is systematically generated.

    “Navigate, like many other benchmark datasets such as RuleTaker (Clark et al., 2020), is systematically generated.”

    From Reliable Reasoning Beyond Natural Language (2024) · cites this paper as Clark et al., 2020

  • These previous benchmarks revealed that models at the time struggle as proof depth increases, but the depths studied remain shallow.

    “These benchmarks revealed that models at the time struggle as proof depth increases, but the depths studied remain shallow.”

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

2 of the 41 references couldn’t be matched to a known paper.

Research works printed but not linked: 5

  1. [Abdelaziz et al. , 2020] Ibrahim Abdelaziz, Veronika Thost, Maxwell Crouse, and Achille Fokoue. An experimental study of formula embeddings for automated theorem proving in first-order logic. arXiv , 2002.00423, 2020. · arXiv
  2. [Richardson and Sabharwal, 2019] Kyle Richardson and Ashish Sabharwal. What does my qa model know? devising controlled probes using expert knowledge. ArXiv , abs/1912.13337, 2019. · arXiv
  3. [Saxton et al. , 2019] David Saxton, Edward Grefenstette, Felix Hill, and Pushmeet Kohli. Analysing mathematical reasoning abilities of neural models. In ICLR , 2019.
  4. [Selsam et al. , 2019] Daniel Selsam, Matthew Lamm, Benedikt B¨ unz, Percy Liang, Leonardo de Moura, and David L. Dill. Learning a SAT solver from single-bit supervision. In ICLR , 2019.
  5. [Talmor et al. , 2019] A. Talmor, Y. Elazar, Y. Goldberg, and J. Berant. oLMpics - on what language model pre-training captures. ArXiv , abs/1912.13283, 2019. · arXiv

Cited by

Sorted by citations

Authors
Clark, P., Tafjord, O., & Richardson, K.
Affiliations
Allen Institute for Artificial Intelligence (US)
Venue
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence
Published
2020-07
Pages
3882-3890
OpenAlex
W3006188107
Cited by
176
References
41
Citations by year
2026: 8 · 2025: 19 · 2024: 15 · 2023: 41 · 2022: 37 · 2021: 37 · 2020: 18 · 2019: 1
FWCI
12.69
Type
conference paper
Language
en
Open access
Locations
  • International Joint Conference on Artificial Intelligence (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
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
natural language reasoning, transformer models, synthetic training data, rule-based reasoning, knowledge representation, theorem proving, question answering, explainability, counterfactual reasoning, knowledge distillation

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.

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