MétaCan
Menu
Back to cohort
Record W2588156857 · doi:10.1037/xlm0000372

Rule-based reasoning is fast and belief-based reasoning can be slow: Challenging current explanations of belief-bias and base-rate neglect.

2017· article· en· W2588156857 on OpenAlexaff
Ian R. Newman, Maia Gibb, Valerie A. Thompson

Bibliographic record

VenueJournal of Experimental Psychology Learning Memory and Cognition · 2017
Typearticle
Languageen
FieldDecision Sciences
TopicDecision-Making and Behavioral Economics
Canadian institutionsUniversity of Saskatchewan
Fundersnot available
KeywordsBelief revisionDual process theory (moral psychology)NeglectCognitive psychologyAnalytic reasoningPsychologyPsychology of reasoningDual (grammatical number)Verbal reasoningBase (topology)False beliefProcess (computing)Knowledge baseReasoning systemComputer scienceArtificial intelligenceCognitionMathematicsTheory of mind

Abstract

fetched live from OpenAlex

It is commonly assumed that belief-based reasoning is fast and automatic, whereas rule-based reasoning is slower and more effortful. Dual-Process theories of reasoning rely on this speed-asymmetry explanation to account for a number of reasoning phenomena, such as base-rate neglect and belief-bias. The goal of the current study was to test this hypothesis about the relative speed of belief-based and rule-based processes. Participants solved base-rate problems (Experiment 1) and conditional inferences (Experiment 2) under a challenging deadline; they then gave a second response in free time. We found that fast responses were informed by rules of probability and logical validity, and that slow responses incorporated belief-based information. Implications for Dual-Process theories and future research options for dissociating Type I and Type II processes are discussed. (PsycINFO Database Record

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.006
metaresearch head score (Gemma)0.083
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.010
Threshold uncertainty score0.035

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0060.083
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0000.003
Scholarly communication0.0040.009
Open science0.0010.002
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0100.001

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.154
GPT teacher head0.426
Teacher spread0.272 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations112
Published2017
Admission routes1
Has abstractyes

Explore more

Same venueJournal of Experimental Psychology Learning Memory and CognitionSame topicDecision-Making and Behavioral EconomicsFrench-language works237,207