<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Fact Engineering on Architect PARK JUN WOO</title><link>https://www.parkjunwoo.com/tags/fact-engineering/</link><description>Recent content in Fact Engineering on Architect PARK JUN WOO</description><generator>Hugo</generator><language>en</language><lastBuildDate>Sun, 26 Jul 2026 17:20:00 +0900</lastBuildDate><atom:link href="https://www.parkjunwoo.com/tags/fact-engineering/index.xml" rel="self" type="application/rss+xml"/><item><title>From Claims to a Graph of Accepted Facts</title><link>https://www.parkjunwoo.com/tech/from-claims-to-gaf/</link><pubDate>Sun, 26 Jul 2026 16:45:00 +0900</pubDate><guid>https://www.parkjunwoo.com/tech/from-claims-to-gaf/</guid><description>Before a machine can judge the real world deterministically, it must explicitly close that world: evaluate open Claims, project Accepted Facts into a traceable graph, freeze the boundary, and preserve a path to appeal.</description></item><item><title>Truth Is Not Discovered</title><link>https://www.parkjunwoo.com/opinion/truth-is-not-discovered/</link><pubDate>Thu, 23 Jul 2026 10:00:00 +0900</pubDate><guid>https://www.parkjunwoo.com/opinion/truth-is-not-discovered/</guid><description>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.</description></item><item><title>Triples Are Claims, Not Facts</title><link>https://www.parkjunwoo.com/opinion/toulmin-knowledge-graph/</link><pubDate>Fri, 22 May 2026 10:00:00 +0900</pubDate><guid>https://www.parkjunwoo.com/opinion/toulmin-knowledge-graph/</guid><description>Wikidata triples are not facts — they are claims. Layer Toulmin&amp;rsquo;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.</description></item><item><title>toulmin — A Rule Engine That Computes Contracts</title><link>https://www.parkjunwoo.com/tech/toulmin/</link><pubDate>Sun, 22 Mar 2026 10:00:00 +0900</pubDate><guid>https://www.parkjunwoo.com/tech/toulmin/</guid><description>Rule engines have treated their validation targets as facts for 60 years. toulmin treats them as claims. An implementation of Toulmin&amp;rsquo;s argumentation model as a Go rule engine.</description></item></channel></rss>