MétaCan
Menu
Back to cohort
Record W1640057716 · doi:10.26686/ajl.v3i0.1769

Justification of Argumentation Schemes

2005· article· en· W1640057716 on OpenAlexaff
Douglas Walton

Bibliographic record

VenueThe Australasian Journal of Logic · 2005
Typearticle
Languageen
FieldComputer Science
TopicMulti-Agent Systems and Negotiation
Canadian institutionsUniversity of Winnipeg
Fundersnot available
KeywordsArgumentation theoryArgument (complex analysis)Defeasible estateInferenceEpistemologyComputer scienceScheme (mathematics)Key (lock)Argumentation frameworkArtificial intelligenceMathematicsPhilosophyComputer security

Abstract

fetched live from OpenAlex

Argumentation schemes are forms of argument that capture stereotypical patterns of human reasoning, especially defeasible ones like argument from expert opinion, that have proved troublesome to view deductively or inductively. Much practical work has already been done on argumentation schemes, proving their worth in A1 [19], but more precise investigations are needed to formalize their structures. The problem posed in this paper is what form justification of a given scheme, as having a certain precise structure of inference, should take. It is argued that defeasible argumentation schemes require both a systematic and a pragmatic justification, of a kind that can only be provided by the case study method of collecting key examples of arguments of the types traditionally classified as fallacies, and subjecting them to comparative examination and analysis. By this method, postulated structures for schemes can be formulated as hypotheses to solve three kinds of problems: (1) how to classify such arguments into different types, (2) how to identify their premises and conclusions, and (3) how to formulate the critical questions used to evaluate each type of argument.

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.019
metaresearch head score (Gemma)0.059
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: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.019
Threshold uncertainty score0.100

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0190.059
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0020.002
Bibliometrics0.0060.004
Science and technology studies0.0040.011
Scholarly communication0.0100.014
Open science0.0030.006
Research integrity0.0070.004
Insufficient payload (model declined to judge)0.0130.002

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.041
GPT teacher head0.295
Teacher spread0.254 · 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

Citations45
Published2005
Admission routes1
Has abstractyes

Explore more

Same venueThe Australasian Journal of LogicSame topicMulti-Agent Systems and NegotiationFrench-language works237,207