MétaCan
Menu
Back to cohort
Record W2566279597 · doi:10.3233/978-1-61499-686-6-327

Formalizing Balancing Arguments

2016· book-chapter· en· W2566279597 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueFrontiers in artificial intelligence and applications · 2016
Typebook-chapter
Languageen
FieldSocial Sciences
TopicEducational Tools and Methods
Canadian institutionsUniversity of Windsor
Fundersnot available
KeywordsComputer science

Abstract

fetched live from OpenAlex

Dung intended his abstract argument frameworks to be used for modeling a particular form of human argumentation, where arguments attack each other and are evaluated following the principle summarized by “The one who has the last word laughs best.” However this form does not fit a wide class of arguments, which is arguably more prototypical and common in human argumentation, namely arguments where pros and cons are balanced to choose among alternative options. Here we present a formal model of structured argument which generalizes Dung abstract argumentation frameworks to also handle balancing. Unlike most other models of structured argument, this model does not map structured arguments to abstract arguments. Rather it generalizes abstract argumentation frameworks, allowing them to be simulated using structured arguments. The model can handle cumulative arguments (“accrual”) without causing an exponential blowup in the number of arguments and has been fully implemented in Version 4 of the Carneades Argumentation System.

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation 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: Other · Consensus signal: Other
Teacher disagreement score0.505
Threshold uncertainty score0.571

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

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.080
GPT teacher head0.373
Teacher spread0.293 · 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