MétaCan
Menu
Back to cohort
Record W2023187384 · doi:10.1075/pc.20.1.01wal

The Carneades model of argument invention

2012· article· en· W2023187384 on OpenAlexaff
Douglas Walton, Thomas F. Gordan

Bibliographic record

VenuePragmatics & Cognition · 2012
Typearticle
Languageen
FieldComputer Science
TopicMulti-Agent Systems and Negotiation
Canadian institutionsUniversity of Windsor
Fundersnot available
KeywordsArgumentation theoryArgument (complex analysis)SkepticismInferenceEpistemologyArgument mapPhilosophyComputer science

Abstract

fetched live from OpenAlex

Argument invention is a method that can be used to help an arguer find arguments that could be used to prove a claim he needs to defend. The aim of this paper is to show how argumentation systems recently developed in artificial intelligence can be applied to the task of argument invention. One such system called Carneades is featured. Carneades can be used to analyze arguments, evaluate arguments, to make an argument diagram, and to construct arguments from a database. Using some simple examples, the paper explains how Carneades works as a system of argument invention.

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.004
metaresearch head score (Gemma)0.008
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.018
Threshold uncertainty score0.062

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0040.008
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.002
Bibliometrics0.0040.002
Science and technology studies0.0040.013
Scholarly communication0.0090.014
Open science0.0030.005
Research integrity0.0050.003
Insufficient payload (model declined to judge)0.0180.003

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.047
GPT teacher head0.272
Teacher spread0.225 · 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

Citations6
Published2012
Admission routes1
Has abstractyes

Explore more

Same venuePragmatics & CognitionSame topicMulti-Agent Systems and NegotiationFrench-language works237,207