MétaCan
Menu
Back to cohort
Record W4311442015 · doi:10.22329/il.v42i4.6877

A Network of Argumentation Schemes and Critical Questions

2022· article· en· W4311442015 on OpenAlexvenueno aff
Sung-Jun Pyon, Yong-Sok Ri

Bibliographic record

VenueInformal Logic · 2022
Typearticle
Languageen
FieldComputer Science
TopicMulti-Agent Systems and Negotiation
Canadian institutionsnot available
Fundersnot available
KeywordsArgumentation theoryConstruct (python library)EpistemologyComputer scienceScheme (mathematics)Probabilistic argumentationManagement scienceSociologyMathematicsPhilosophyProgramming languageEngineering

Abstract

fetched live from OpenAlex

In this paper, we devise a network that consists of argumentation schemes and critical questions that participants in debates can use to easily construct arguments that attack or support former arguments. As a prototype, we build a potential network of argumentation schemes and critical questions with a practical reasoning scheme at its center. The usefulness of a NASCQ in constructing and reconstructing complex arguments and in formal argumentation is also explored along with argumentation more broadly.

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.012
metaresearch head score (Gemma)0.033
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.012
Threshold uncertainty score0.063

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0120.033
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0060.004
Science and technology studies0.0040.008
Scholarly communication0.0070.016
Open science0.0020.005
Research integrity0.0030.002
Insufficient payload (model declined to judge)0.0110.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.027
GPT teacher head0.282
Teacher spread0.255 · 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

Citations1
Published2022
Admission routes1
Has abstractyes

Explore more

Same venueInformal LogicSame topicMulti-Agent Systems and NegotiationFrench-language works237,207