MétaCan
Menu
Back to cohort
Record W625795696 · doi:10.1017/cbo9781107110311

Burden of Proof, Presumption and Argumentation

2014· book· en· W625795696 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

VenueCambridge University Press eBooks · 2014
Typebook
Languageen
FieldSocial Sciences
TopicArtificial Intelligence in Law
Canadian institutionsUniversity of Windsor
Fundersnot available
KeywordsPresumptionArgumentation theoryArgument (complex analysis)Burden of proofEpistemologyDefeasible reasoningComputer sciencePolitical scienceLawPhilosophyMedicine

Abstract

fetched live from OpenAlex

The notion of burden of proof and its companion notion of presumption are central to argumentation studies. This book argues that we can learn a lot from how the courts have developed procedures over the years for allocating and reasoning with presumptions and burdens of proof, and from how artificial intelligence has built precise formal and computational systems to represent this kind of reasoning. The book provides a model of reasoning with burden of proof and presumption, based on analyses of many clearly explained legal and non-legal examples. The model is shown to fit cases of everyday conversational argumentation as well as argumentation in legal cases. Burden of proof determines (1) under what conditions an arguer is obliged to support a claim with an argument that backs it up and (2) how strong that argument needs to be to prove the claim in question.

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.000
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: Not applicable · Consensus signal: none
GenreCandidate signal: Other · Consensus signal: Other
Teacher disagreement score0.967
Threshold uncertainty score0.759

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.001
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.038
GPT teacher head0.273
Teacher spread0.236 · 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