Toulmin
Truth Is Not Discovered
In the open world there is no truth to discover — every observation is bound by the speed of light and never reaches the event itself. But in worlds closed by declaration — fiction, mathematics, law — truth exists. A trial is the process of projecting reality into a legal world, and a verdict is a computation performed upon it. What LLMs lack right now is not a bigger model, but an explicit closure procedure like the rule of law.
TANGEUL — Rules Written in Markdown, Audited by Humans
TANGL lets you write toulmin rule graphs as markdown sentences instead of Go code, so a non-programmer can audit them. TANGEUL is the binary source of truth those markdown surfaces now encode into.
reins — Keep Only the Domain in a Quest CLI; Make the Ratchet a Framework
how-make-quest taught you to build a quest CLI with your bare hands. But build a second CLI and you write the same ratchet, the same scan/next/submit, the same tallying all over again. reins pulls that invariant out into a framework — reins supplies the ratchet, the command skeleton, the tallying, and export; you implement only your domain's gate (the four methods of gate.Definition). The gate is a catalog of cheese-defense rules, and the toulmin defeat graph hands the agent a strategy guide for 'why you lost and what to change to win.'
Triples Are Claims, Not Facts
Wikidata triples are not facts — they are claims. Layer Toulmin's argumentation model on top of triples, and you get a dynamic knowledge graph where verdicts change with context. Storage is argumentation structure; judgment happens at runtime.
toulmin — A Rule Engine That Computes Contracts
Rule engines have treated their validation targets as facts for 60 years. toulmin treats them as claims. An implementation of Toulmin's argumentation model as a Go rule engine.