Using Toulmin Argumentation to develop an Online Dispute Resolution Environment
Bibliographic record
Abstract
ABSTRACT: Our goal is to model reasoning in discretionary legal domains. To do so, we use Knowledge Discovery from Database Techniques. However there are obstacles to this approach, including difficulties in generating explanations once conclusions have been inferred, difficulties associated with the collection of sufficient data from past cases and difficulties associated with integrating two vastly different paradigms. Toulmin’s treatise on the uses of argument can be gainfully employed to construct legal decision support systems in discretionary domains. We show how we can use Toulmin’s approach to build such systems with examples taken from the domains of eligibility for legal aid, evaluation of eyewitness evidence, family law, refugee law and sentencing. We then show how Toulmin Argument Structures can be developed to construct an Online Dispute Resolution environment that allows for determining BATNAs, exchanging opinions and providing advice about tradeoffs.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.008 | 0.014 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.003 | 0.004 |
| Scholarly communication | 0.006 | 0.011 |
| Open science | 0.003 | 0.008 |
| Research integrity | 0.003 | 0.003 |
| Insufficient payload (model declined to judge) | 0.007 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".