MétaCan
Menu
Back to cohort
Record W2034640569 · doi:10.1017/s0269888907001051

Argument diagramming in logic, law and artificial intelligence

2007· article· en· W2034640569 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.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueThe Knowledge Engineering Review · 2007
Typearticle
Languageen
FieldComputer Science
TopicMulti-Agent Systems and Negotiation
Canadian institutionsUniversity of WinnipegUniversity of Manitoba
FundersSocial Sciences and Humanities Research Council of CanadaLeverhulme Trust
KeywordsArgumentation theoryArgument (complex analysis)Informal logicArgument mapEpistemologyContext (archaeology)Computer scienceArtificial intelligenceSociologyPhilosophyGeography

Abstract

fetched live from OpenAlex

Abstract In this paper, we present a survey of the development of the technique of argument diagramming covering not only the fields in which it originated — informal logic, argumentation theory, evidence law and legal reasoning — but also more recent work in applying and developing it in computer science and artificial intelligence (AI). Beginning with a simple example of an everyday argument, we present an analysis of it visualized as an argument diagram constructed using a software tool. In the context of a brief history of the development of diagramming, it is then shown how argument diagrams have been used to analyse and work with argumentation in law, philosophy and AI.

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.002
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: Empirical · Consensus signal: none
Teacher disagreement score0.984
Threshold uncertainty score0.293

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.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.038
GPT teacher head0.291
Teacher spread0.252 · 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