MétaCan
Menu
Back to cohort
Record W2915908076 · doi:10.1177/1365712718813795

Taking the dialectical stance in reasoning with evidence and proof

2018· article· en· W2915908076 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

VenueThe International Journal of Evidence & Proof · 2018
Typearticle
Languageen
FieldSocial Sciences
TopicArtificial Intelligence in Law
Canadian institutionsUniversity of Windsor
Fundersnot available
KeywordsArgumentation theoryDialecticProbabilistic logicProbabilistic argumentationComputer scienceEpistemologyDefeasible reasoningProcess (computing)Order (exchange)Deductive reasoningArtificial intelligencePsychologyCognitive sciencePhilosophyProgramming language

Abstract

fetched live from OpenAlex

We present a computational argumentation approach that models legal reasoning with evidence and proof as dialectical rather than probabilistic. This hybrid approach of stories and arguments models the process of proof in a way that is compatible with Allen and Pardo's theory of relative plausibility by adding arguments that can be used to show how evidence can support or attack explanations. Using some legal cases as examples, we show how criteria for assessing explanations connect arguments and evidence to story schemes. We show how this hybrid dialectical approach avoids the main problem of the probabilistic approaches, namely that they require precise numbers to be applied in order to decide legal cases. We provide an alternative method that allows fact-finders to reason with evidence holistically and not in the item-by-item fashion proposed by the probabilistic account.

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.005
metaresearch head score (Gemma)0.010
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMetaresearch
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Observational · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.343
Threshold uncertainty score0.998

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0050.010
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.002
Scholarly communication0.0000.001
Open science0.0010.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.214
GPT teacher head0.447
Teacher spread0.233 · 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