What is SGF?

Mike's Notes

This is part of a series of thoughtful opinions about using Ontology in software information systems.

Pipi has an existing BORO Engine (bor) (inspired by Chris Partridge's book "Business Objects: Re-engineering for Re-use"), but it runs in reverse: it imports triples to extract entities and relationships, then uses them to build reference relational databases for back-end industry workspaces.

Part five: An article by James Lee Stakelum that summarises SGF. A PDF is also available.

Resources

References

  • SGF: The Symbol Grounding Framework, James Lee Stakelum. GitHub. 2026.

Repository

  • Home > Ajabbi Research > Library >
  • Home > Handbook > 

Last Updated

18/08/2026

What is SGF?

By: James Lee Stakelum
Medium: 11/08/2026

I'm deep into building an architecture for structured knowledge, and using AI to create cinematic quality movies.


The SGF (Symbol Grounding Framework) project is moving fast!

Six volumes have been published on Amazon. The GitHub repository contains formal RFCs, reference implementations, and numerous essays. The architecture has grown from a single insight about dictionaries into a seven-layer stack with three core components: a governance language called ‘Omega’ that enforces what the machine CAN, MAY, and DO; a machine-to-machine protocol called HFF that lets machines communicate with zero prior integration; and an operating system for autonomous systems that has a constitution, the ability to mint new laws — as long as they are constitutional — and sovereignty: the power to refuse outside instructions that violate its own rules.

But there’s a problem: the information about SGF is spread across several books, RFCs, published code, and essays. If you want to understand “what is SGF?” you currently need to read six books and several thousand lines of specification.

I’m working on a new book that puts everything into one book, but decided as an interim solution to consolidate the big picture into a single white paper. I will provide the link to the white paper below.

But first, let me give you the overview — the five-minute talk I would give if I were standing in front of a room describing SGF.

...

SGF is a deterministic Semantic Infrastructure. It lives in the broader space of Verifiable Knowledge Infrastructure — systems that can represent meaning, verify it, trace it to its source, and govern actions based on it.

First, let me give you the back-story.

When I first started the SGF project, began by writing code to transform prose from textual documents (PDFs, wikipedia articles, etc) into a structured format and storing it in a knowledge graph, so that human knowledge could be stored in a structured format that LLMs could use, instead of RAG, so it would be easily inspectable and verifiable (you dont normally see where an LLM got its facts), and be tagged with provenance showing where each fact came from, etc.

I began searching for a structure that could hold meaning at the grain of a clause. A sentence might span multiple clauses and therefore is not the right grain. A RDF triplet is too small for my intended purposes for many reasons I have explained elsewhere in SGF essays.

Thematic role theory was a natural fit. Thematic role theory deconstructs a clause into a core predicate and a set of universal semantic roles that define how participants in the clause relate to the action, independent of surface grammar. Rather than relying solely on grammatical labels like subject or object, the framework maps sentence participants to specific semantic functions — such as agents, patients, instruments, and goals — governed by the intrinsic argument structure of the verb.

Using thematic role theory, I arrived at a hub-and-spoke structure — one verb, its participants, their roles — without shattering it across multiple fragments. That search led to an architecture.


First: a schema and grammar for structured knowledge.

Most knowledge representations use triples — subject-predicate-object. Triples fragment events. An event that involves an agent, a patient, a time, a location, an instrument, and a reason shatters across multiple triples, losing the structural integrity of the original claim.

SGF uses a Synapse — a verb hub with exactly 15 fixed thematic roles. These roles come from 50 years of cross-linguistic research in thematic role theory — Fillmore, Jackendoff, FrameNet. They are not arbitrary. They are the discovered universal slots through which participants attach to events.

Every clause compiles into exactly one Synapse. No event fragments. The roles are closed, which means integration cost drops from N² to N. An engineer does not need to learn a new relationship vocabulary for each domain. The same 15 roles serve contracts, medical guidelines, military operation orders, and manufacturing specifications.

Every Synapse carries its provenance — source document, section, sentence, offset. Every Synapse carries its epistemic status — is this a core definition, a sourced observation, an inferred conclusion, or a ghost that the system knows exists but cannot yet resolve? SGF does not decide who is telling the truth. It records what was said, by whom, and with what source. Truth is resolved at query time, not ingestion time.

I’m a bit embarrased to say that early in the SGF project, I naively assumed all thought was atomic. Like “Ludwig van Beethoven was born in 1770” is an example of what I would consider an atomic thought. It can stand alone, as long as you can tether each term to a dictionary that tells you what each term in that sentence means. But the recipe to bake a chocolate cake is not atomic. Each step is an atom, and to extend the metaphor, I needed linking mechanisms to join the atoms in meaningful ways. That led me to linking types.

Synapses compose into larger structures via 8 link types — CAUSES, SUPPORTS, CONTRADICTS, PRECEDES, DEPENDS_ON, and others. A recipe, a contract, a military operation order is molecular, not atomic.

And, furthermore, these larger structure are composable into even larger structures.

...

Second: a recipe for bootstrapping a shared dictionary — the dictionary itself is not mandatory, but the network effects are real.

Language is a lossless compression algorithm. We say “wagon” instead of saying “a container mounted to an axle with wheels and a hitch so it can be pulled.” We compress complex cognitive scripts into single tokens because the serial interface of speech is slow. Compression lets us transmit meaning faster than we could decompress it.

But compression without decompression is just noise. Most dictionaries fail at decompression because they are lossy — they define complex words using other complex words. Pail equals bucket. Bucket equals pail. The chain never terminates.

SGF’s approach is different. The architecture requires that two parties agree on a shared dictionary. Any dictionary. Your organization’s existing ontology. An industry-standard taxonomy. A custom-built lexicon. What matters is that both parties point to the same reference and agree that when they use a Canonical ID from that dictionary, they mean the same thing.

If you already have a dictionary, use yours. The architecture does not care which dictionary you choose. It cares that you agree on one.

What SGF provides as a convenience is the Synapedia — a recipe for bootstrapping a very large dictionary from open sources. WordNet for core vocabulary. Wiktionary for long-tail coverage across hundreds of languages. Wikipedia for world knowledge. The bootstrap scripts are on GitHub. Given the same snapshot and pipeline, any party can rebuild a conformant Synapedia in hours and verify its content hashes.

The Synapedia is a design pattern template. It shows you how to structure a shared dictionary with Canonical IDs, microglosses, IS_A chains, polyhierarchy, and prime grounding. You can follow the same pattern with your own dictionary.

There is a network effect, and it is real. Like the fax machine, the value of a shared dictionary compounds with each additional party that agrees to use it. The first integration takes time. The tenth is faster. The hundredth is nearly automatic.

What is mandatory is the Canonical ID — the structured identifier that carries disambiguating meaning in the ID itself. en.bank.financial_institution.noun.core. Not a UUID. Not a random string. The language, the lemma, the microgloss, the part of speech, the namespace — all in the ID. Two systems that have never communicated can resolve this ID to the same sense without a prior agreement.

And what both parties must have is their own private lexicon — an in-house dictionary for the terms unique to their world. Internal product codes. Organizational jargon. These live in the private lexicon, not in the shared dictionary. When they cross a boundary, the message includes a dictionary segment for each private term, tethered to the shared dictionary via binary ontological links.

The relevant links include:

  • IS_A — connects a concept to its parent concept. A water_pump IS_A pump.
  • INSTANCE_OF — connects a specific individual to its concept class. A pump with serial number ABC123 INSTANCE_OF water_pump.
  • HAS_PART, HAS_ATTRIBUTE, SAME_AS and others.

IS_A and INSTANCE_OF are distinct. IS_A operates between concepts. INSTANCE_OF operates between an instance and a concept. Ontologists care about this distinction, and they are right to care.

Not all prose is suitable for this. Joyce’s Ulysses will produce more GapReports than Synapses — and that is by design. The system does not pretend it can parse everything.

At the bottom of every IS_A chain: 65 semantic primes from the Natural Semantic Metalanguage. Irreducible concepts like SOMEONE, SOMETHING, DO, HAPPEN, GOOD, BAD, THINK, FEEL, BODY. If a term cannot reach a prime — if it is a hallucination, a fabrication, a term that has no route to shared ground — the system returns UNKNOWN. It does not fabricate. It does not guess. It reports the gap.

...

A note on how this relates to existing ontology standards.

This is the dual-axis alignment, and it is one of the most important things to understand about SGF.

BFO and CCO — the ontology standards the DoD and Intelligence Community have adopted — guarantee formal consistency. They answer: “Does this classification respect our axioms?” They do not answer: “Does this concept correspond to anything real?” An LLM might fabricate a “chronospatial dampening array,” BFO might classify it as Artifact → Independent Continuant, every axiom satisfied, and the system accepts a fabrication with mathematical certainty.

SGF operates on two separate axes to address this.

Axis 1 — The semantic axis. This handles human language — cognition, intent, compression, decompression, metaphor, social constructs. It is grounded in 65 NSM primes. Its purpose is anti-hallucination: every term must trace an IS_A chain back to bedrock or the system returns UNKNOWN. This axis answers: “Does this concept correspond to anything we can ground in shared meaning?”

Axis 2 — The ontological axis. This handles institutional compliance — BFO, CCO, audit trails, export to formal standards. Its purpose is consistency across systems: when an entity leaves SGF’s internal runtime and enters the institutional record, it must speak the language that review boards, regulators, and partner systems already understand. This axis answers: “Does this concept satisfy our formal classification axioms?”

These are separate axes because meaning and existence are different things, modeled by different frameworks, serving different purposes. No single framework can serve both. That is why SGF keeps them on separate axes, connected by a deterministic bridge that translates without conflating.

The bridge between them is a set of transformation rules. The semantic runtime preserves terms as they appear in human language. At the export boundary, those terms are mapped to their closest BFO categories, with documentation annotations where the mapping is imperfect. The bridge is one-directional by default — from the semantic runtime outward to the institutional record — because the ingestion pipeline must remain open to human language, while the export boundary must speak the language of formal ontology.

I want to be clear about where SGF currently stands. Formal BFO certification is not an active project focus today. The current focus is engineering the architecture, producing working code, and finding implementation partners. But the architecture is designed for this alignment from the ground up.

The mapping is not always clean. Consider a hole. NSM says a hole is a THING — it has location, shape, it can be created and destroyed. Language treats holes as entities. BFO says a hole is not an Independent Continuant — it is a fiat surface, a dependent entity. SGF does not hide this tension. It preserves the term on the semantic axis and maps to the closest category on the ontological axis, with documentation explaining the discrepancy.

BFO ensures consistency. NSM ensures truth. Together, they provide what neither can provide alone.

...

Third: a protocol for machine-to-machine communication that requires zero prior integration.

Most integrations are pairwise. Every pair of systems requires bespoke ontology mapping, data format alignment, and policy negotiation. The cost scales as N².

SGF’s protocol layer — HFF (Honest Fact Forwarding) and AFP (Act Framing Protocol) — lets two machines that have never met exchange meaning on first contact. Both share a dictionary. The sender brings its own definitions for terms not in the shared dictionary, tethered to it via binary links. The receiver follows the links back to shared ground.

Why does AFP matter? A robot that parses “Can you pass the salt?” as a yes/no question about physical capability, confirms it can, and then does nothing — that is the failure AFP prevents. AFP declares what act the message is performing. Thirteen act types — INFORM, COMMAND, PROMISE, REFUSE, CONFIRM, ERROR, and others — tell the receiver whether this is a statement, a request, an order, or a promise. The same payload wrapped in INFORM versus COMMAND goes through completely different authority gates.

Every message passes through five integrity gates: schema validation, hash verification, signature verification, freshness check, and lexicon hydration. A message that fails any gate is rejected. A message that passes all five is a candidate for admission — not an instruction to obey. The receiver remains sovereign.

...

Once I had the dictionary, I realised… Each layer exposed the absence of the next.

This is how the architecture grew. I started with the grammar and the dictionary. Once I had those, I realized two machines that wanted to exchange this structured meaning needed a protocol. That led to HFF and AFP. Then I realized governance could not be a prose prompt. That led to Omega. Then I realized the system needed a way to learn from its own experience. That led to Wisdom Harvesting.

Each layer exposed the absence of the next. The architecture was not designed in a single pass. It was discovered through building.

...

Fourth: an operating system with a small stable kernel, continuous learning of wisdom, sovereignty, and the ability to mint new laws.

Knowing what a message means is not the same as knowing whether the requested action is permitted.

Omega is a governance language with exactly 13 primitives. It is non-Turing-complete. It is compiled at load time. It is fail-closed — no matching rule means DENY. CANMAYDO is enforced as a structural constraint, not a suggestion. A machine that can parse a command cannot execute it unless a compiled rule explicitly permits it.

The Event Horizon separates probabilistic reasoning from deterministic action. The LLM proposes. The governance layer decides. The actuator executes only when the governance layer says ALLOW. The kernel — small, deterministic, never-changing — mediates the crossing. It cannot be overridden at runtime.

Wisdom Harvesting sits above the stack, monitoring every interaction, extracting cross-domain principles, and storing them in a retrievable corpus. The kernel does not modify itself. It accumulates wisdom. A rule learned from a database connection timeout — “release finite shared resources after use” — is surfaced when a mutex deadlock occurs in an entirely different context months later.

The machine has sovereignty. It can refuse a command that violates its constitution. It can mint new laws within constitutional constraints, adapting to novel situations that were not anticipated at design time.

...

And it compounds.

This part matters more than I have let on so far.

Most systems do not learn. They are loaded with knowledge at deployment, and that is all they ever know. SGF is different. Above the stack sits a Wisdom Harvesting pipeline that monitors every interaction — every GapReport, every governance decision, every alignment failure, every success — and extracts cross-domain principles from them.

A rule learned from a database connection timeout — “release finite shared resources after use” — is surfaced months later when a mutex deadlock occurs in an entirely different context. A lesson from aerospace manufacturing — “when a provenance chain has been incomplete for two consecutive batches, escalate verification depth” — appears in an industrial robotics setting where the system has never encountered aerospace data.

The kernel never changes. It stays small, deterministic, certifiable. The wisdom grows above it, accumulating with every operation, every failure, every success. The system gets better with use.

This is not a feature. It is a different category of system.

...

Design patterns have emerged from using this architecture.

SOAM aligns Synapse Trees node by node across five dimensions — branch matching, concept matching, constraint comparison, frame alignment, and modality alignment. Every failure produces a GapReport. The Decider produces one of five outcomes: ACCEPT, REJECT, CONDITIONAL, CLARIFY, or ESCALATE. The system never guesses.

The Returns Pattern lets a warehouse identify a returned part that has no packaging and no SKU label. The system uses visual features and verbal descriptions, aligning against the catalog through the same depth hierarchy that serves specification verification.

The Privacy-Preserving Verification Pattern lets a contractor prove a component meets a specification by exporting an 86-character fingerprint and pass/fail flags. No proprietary data leaves the air gap.

Each pattern is a reusable solution to a problem that previously required bespoke engineering.

...

Every formalism leaves a remainder. SGF does not claim to have closed the gap between structure and meaning. It provides mechanisms for inhabiting that gap honestly.

The GapReport is not a failure mode. It is a design feature. When the system cannot ground a term, assign a role, resolve a pronoun, or classify a clause, it says so. It does not fabricate. It does not guess. It produces a structured report naming exactly what is missing.

A court reporter does not decide who is telling the truth. The court reporter records what was said. SGF is that court reporter for machine meaning.

...

The full white paper covers all of this in depth.

It describes the complete seven-layer stack, the dual-axis ontological alignment, the formal evaluator model for Omega, the Wisdom Harvesting pipeline, the convergence argument, the honest claims, and the implementation status.

The PDF and Markdown versions are on GitHub:

The repository also contains numerous essays, the RFCs, and working code for bootstrapping the shared dictionary and for transforming prose into structured format.

I’m moving as fast as I can, and there’s more code that still needs to be written. The code I’ve written is intended to help get you started. You may want code in your own language of choice. I purposely wrote the RFCs in a form that, mostly, can be compiled into code of your preference — Python, C++, Java, Rust.

A closing thought.

I started with some simple questions: can we build a decompression mapping for language? Can we reverse the compression that turns a container mounted to an axle with wheels and a hitch into ‘wagon’? Can we build a process that compiles prose into a structured format, with each term tethered to a shared dictionary?

The answers turned out to be yes. And that unlocked an operating system — a system that can represent meaning deterministically, share it across trust boundaries with zero prior integration, govern its own actions through a written constitution, and compound its expertise over time.

The architecture is open. The code is Apache 2.0. The standards are published as RFCs.

The question is not whether this is possible. The question is what we will build with it.

The Architecture That Makes AI Trustworthy Wasn’t Invented. It Was Discovered

Mike's Notes

This is part of a series of thoughtful opinions about using Ontology in software information systems.

Pipi has an existing BORO Engine (bor) (inspired by Chris Partridge's book "Business Objects: Re-engineering for Re-use"), but it runs in reverse: it imports triples to extract entities and relationships, then uses them to build reference relational databases for back-end industry workspaces.

Part four: An article by James Lee Stakelum that reviews Permion, its architecture and some options.

Resources

References

  • Business Objects: Re-engineering for Re-use, Chris Partridge. 2005.

Repository

  • Home > Ajabbi Research > Library >
  • Home > Handbook > 

Last Updated

17/08/2026

The Architecture That Makes AI Trustworthy Wasn’t Invented. It Was Discovered

By: James Lee Stakelum
Medium: 14/07/2026

Epistemic architect and creator of the Symbol Grounding Framework, AI operating systems, machine governance languages, and zero‑integration machine‑to‑machine communication.

...

John Sowa and Arun Majumdar demonstrated a breakthrough inference engine at the 2026 Ontology Summit — twelve agents on a laptop, no GPU, refusing to guess. But the architecture beneath it inherits an open-predicate model that has failed at scale every time it has been tried. This article reveals the convergence between Permion’s engineering and an open architecture called the Symbol Grounding Framework, and explains why the bridge between them will define the next decade of trustworthy AI.

...

1. The Scene

The Ontology Summit. June 3, 2026. John Sowa takes the virtual podium. He is 86 years old. Co-author of the ISO 24707 Common Logic standard. Creator of conceptual graphs. Six decades of work in knowledge representation.

He begins, as he often does, with a warning.

“Anything generated by LLMs is basically a hypothesis,” he says. “It’s a best guess. If it’s inconsistent with the ontology or a verified database, it might be rejected as false.”

This is vintage Sowa. He has been saying this since before LLMs existed. The message is not new. What is new is the context. He is speaking as a Fellow of Permion, a company that just won the G7 GovAI Grand Challenge against over a hundred submissions from across the G7 and EU.

Then Arun Majumdar, Permion’s CEO, takes over. He opens a terminal on a standard MacBook Pro — an Apple M1 Max from 2021, 64 GB of RAM, no GPU. He runs a command. The machine starts processing 100 HTML documents. It uses a graph-based ranking algorithm derived from TextRank, co-authored by the late Paul Tarau, a Permion researcher. It selects the relevant documents. It runs twelve LLM agents simultaneously. Each contributes to a structured threat assessment report. The system processes 9,000 tokens per second. The logic engine — built on Definite Clause Grammars and Common Logic — governs the entire process. If an agent cannot answer, it does not guess. The final report is structured, cited, and formatted precisely.

Twelve agents. On a laptop. No cloud. No GPU.

This is not a vaporware demo. This is running on hardware anyone can buy.

...

2. What Permion Actually Achieved

The demo deserves attention on its own terms.

Running twelve LLMs simultaneously on a consumer laptop represents a fundamental shift in how AI systems can be deployed. Most multi-agent architectures require cloud infrastructure — GPU clusters, high-bandwidth interconnects, centralized orchestration. Permion’s approach runs locally. Every document stays on the machine. Every inference happens on the device. No data leaves the air gap.

Their disk streaming technology is a genuine engineering achievement. Instead of loading entire models into RAM, it indexes the model, predicts which tensors will be needed for a given query, and streams only those tensors from SSD to memory. A system that cannot fit in RAM can still run in real time.

Their Definite Clause Grammar provides semantic constraints that regular expressions cannot express. Variables carry type restrictions. The grammar knows what kind of thing can go where. Their graph-based ranking algorithm, derived from TextRank, finds relevant documents without the blind spots of chunk-based RAG. Their logic engine controls generation, validates outputs, and enforces policy.

This matters beyond the technology itself. Local-first, sovereign AI — running on hardware you own, processing data that never leaves your control — is the only architecture that can meet the security and privacy requirements of government, defense, and regulated industries. Permion has demonstrated that this is not a theoretical possibility but a working reality.

They also won the G7 GovAI Grand Challenge. The problem set was cross-risk geopolitical analysis — a genuinely complex, open-ended problem. Their DSME application won for its explainability, auditability, and compliance. It is deployed on AWS GovCloud and the AWS classified cloud.

Sowa provided the philosophical foundation that makes the architecture coherent. He described Charles Peirce’s cycle of pragmatism: abduction proposes hypotheses, deduction evaluates them against an ontology, action tests them, induction incorporates what was learned into knowledge. This cycle — observe, orient, decide, act — is the fundamental pattern of intelligence. Any system that skips the deduction step cannot be trusted.

For a moment, it seemed complete. Here was a company with both the deep understanding and the engineering to build trustworthy AI.

...

3. The Structural Inheritance

But the engineering and the architecture are two different layers.

Permion uses Common Logic — ISO 24707 — as its representational foundation. Common Logic is a standard for exchanging first-order logic expressions. It is flexible. Any domain expert can define any relation their field requires. In medicine, you can define has_contraindication. In law, statutory_precedence. In aerospace, is_aerodynamically_coupled_with. The predicate vocabulary is open.

This flexibility is a real strength for a single organization. It allows domain experts to express knowledge in whatever terms are natural to their field.

The architecture also uses conceptual graphs, where relations are edges between concept nodes. Subject-predicate-object. The predicate is the connecting edge. This is the standard approach. It is well-understood and widely deployed.

But Common Logic is an open-predicate system. So is RDF. So is OWL. The Semantic Web was built on this same open-predicate foundation, and it failed at scale. Not because the technology was wrong. Because the cost of integration grows quadratically with the number of participants.

Consider two organizations. Organization A defines owes. Organization B defines has_contraindication. Integration requires one mapping. Three organizations require three mappings. Four require six. Ten require forty-five. One hundred require four thousand nine hundred and fifty.

This is the Babel Tax. It is not a theoretical risk. It is a demonstrated failure mode that the Semantic Web community documented over 25 years. The open-predicate model is structurally incapable of escaping it. Every new participant adds new predicates. Every new predicate requires new mappings. The cost compounds.

Permion’s architecture inherits this property because Common Logic, like RDF and OWL, allows any relation to be defined by any party. The demo runs on one machine. The architecture would face the same federation barrier that every open-predicate system has faced.

There is a second inherited weakness. In the edge-based model, an event like “Beethoven composed the Ninth Symphony in Vienna in 1824” becomes three separate fragments:

  • Beethoven composed Ninth Symphony.
  • Ninth Symphony was created in 1824.
  • Beethoven was in Vienna in 1824.

Each fragment is correct. None preserves the unity of the event. A query that asks “what was Beethoven doing in Vienna in 1824?” must reassemble the pieces. The event is not a first-class object. It is a reconstruction.

And there is a third. A verified fact and a provisional guess share the same structural form. Both are Common Logic statements. They are distinguished only by external policy, not by the structure of the claim itself. The demo showed the right behavior — the system refused to guess. But the architecture did not enforce it. The behavior was governed by policy, not by structure.

These are not flaws in Permion’s implementation. They are properties of the underlying standard. Permion’s engineers inherited them.

...

4. The Discovery

I found the Symbol Grounding Framework through a different path — not through the ontology community, but through the knowledge graph and reasoning community. It was not a product. It was a public-domain architecture, published at symbolgrounding.io, with reference code under Apache 2.0.

SGF starts from a different question than Permion does. Permion asks: how do we make inference fast on a single machine? SGF asks: how do we make meaning portable so that two systems that have never met can trust each other on first contact?

The answer was discovered through a process the author calls the qualification gauntlet. It works like this: propose a candidate structure. Subject it to adversarial tests designed to destroy it. If it can be eliminated, eliminate it. Keep only what survives.

The architect began with a hundred candidate semantic roles. Each was tested: could it be expressed as a combination of the others? If yes, it was eliminated. HAS_PURPOSE was eliminated — it is HAS_REASON with a specific frame. HAS_RESULT was eliminated — it is a changed HAS_PATIENT or a separate SynapseLink. HAS_VALUE was eliminated — it is a TypedLiteral or HAS_ATTRIBUTE.

The first pass killed forty. The second killed thirty more. When the dust settled, fifteen roles survived. They were not chosen. They could not be eliminated.

The same process was applied to binary relations. Five survived. To link types. Eight survived. To the verb vocabulary. One generic verb survived — RELATES_TO — with domain-specific relations expressed as concepts rather than primitives.

The result is a grammar of 33 primitives that is closed by construction. Vocabulary is infinite. The grammar is fixed. Integration cost becomes linear. The Babel Tax is not managed or reduced. It is structurally prevented.

But the architecture goes deeper.

Every claim carries an epistemic status from 7 tiers: CORE_DEFINITION, CONSTITUTIVE, SOURCED, CLAIMED, INFERRED, PROVISIONAL, GHOST. A verified fact from WordNet and a provisional guess from an LLM are structurally distinct. The reasoning engine treats them differently by construction, not by policy.

When a term cannot be grounded, SGF cannot guess. There is no mechanism for it. The grammar requires all Spokes to target grounded Canonical IDs or explicitly marked Ghosts. A Ghost node carries a provisional identifier and a GapReport. The system says “I don’t know” because it literally cannot produce a claim without a grounded target.

Below everything sits the Prime Registry. Approximately 65 semantic primes — SOMEONE, SOMETHING, DO, HAPPEN, MOVE, GOOD, BAD, THINK, KNOW, BEFORE, AFTER, HERE, NOW — serve as the bedrock. Every grounded concept must have a finite path down to one or more of these primes. This enables the Stranger Rule: two systems that have never met can understand each other on first contact because every term in an HFF packet can be traced back to shared primes.

Above it all sits Omega, a governance language that compiles policy into deterministic checks. UNKNOWN maps to HALT. The system halts rather than guessing.

Each mechanism exists because a simpler one failed. The open-predicate model failed at scale, so the grammar was closed. The edge-based model fragmented events, so the verb became the hub. The absence of epistemic tracking made facts indistinguishable from guesses, so the status hierarchy was built. The inability to say “I don’t know” allowed hallucinations to propagate, so the Ghost Protocol was created. The lack of a stopping rule for definitions allowed infinite regress, so the Prime Registry was established.

The architecture was not designed on a whiteboard. It was discovered by systematically eliminating everything that broke.

...

5. The Convergence

I went back to the 2024 video. Sowa said: “Without ontology, LLMs are clueless.”

I went back to the 2026 demo. Majumdar said: “LLMs are abduction machines. They create hypotheses.”

Then I looked at the SGF architecture.

Sowa said every output must be tested by deduction. SGF has an epistemic status hierarchy that structurally classifies every claim.

Sowa said reasoning is a cycle of abduction, deduction, induction, action. SGF has a Semantic CPU that walks a grounded graph in exactly this cycle.

Sowa said the system must refuse to guess when uncertain. SGF has a Ghost Protocol and a GapReport that make “I don’t know” a first-class output.

Majumdar showed twelve agents running under a logic engine that controls generation and refuses hallucination. SGF provides the wire protocol and governance language that let those same agents interoperate across organizational boundaries without the quadratic cost of the Babel Tax.

Two independent efforts. Different starting premises. Same structural conclusion.

What Sowa and Majumdar described What SGF provides LLMs are hypothesis generators that must be tested The Probabilistic Sandwich — LLMs propose, gates dispose Outputs must be verified against an ontology Epistemic status hierarchy, SOAM alignment, ProofTrace Reasoning is a cycle of abduction, deduction, induction, action Semantic CPU — deterministic kernel walking grounded graph Multiple agents must be orchestrated under logic HFF/AFP wire protocol for multi-agent coordination The system must refuse to answer when uncertain Ghost Protocol and GapReport An ontology must provide the criteria for truth Closed grammar, Prime Registry, Omega governance

The convergence is not a coincidence. The architecture is not one design among many. It is the shape that emerges when you eliminate everything that does not work.

...

6. The Complementarity

The two efforts are not in competition. They operate at different layers.

Permion’s inference engine is a breakthrough in local-first, multi-agent AI. Twelve agents on a laptop with no GPU. Disk streaming that makes models larger than RAM runnable in real time. A logic engine that refuses to guess. These are genuine achievements.

SGF’s closed grammar prevents the Babel Tax that has crippled every open-predicate system at scale. Its epistemic hierarchy makes the trustworthiness of every claim structurally explicit. Its Ghost Protocol ensures the system cannot guess. Its Stranger Rule enables federation on first contact. Its governance language compiles policy into deterministic checks.

One builds the engine. The other builds the chassis, the steering, and the brakes.

Permion could implement SGF on their XVM. The closed grammar would eliminate the quadratic integration cost. The epistemic hierarchy would make claim trustworthiness structural. The Ghost Protocol would make “I don’t know” an architectural invariant. The Stranger Rule would enable their multi-agent systems to federate across organizational boundaries on first contact.

SGF is public domain. Anyone can implement it. Including Permion.

...

7. What This Means

For AI architects building the next generation of multi-agent systems. The question is no longer whether a closed grammar, an epistemic hierarchy, a gap protocol, and a prime registry are architecturally necessary. The convergence proves they are. The open standard exists at symbolgrounding.io. You can implement it today.

For knowledge graph engineers who have lived through the Babel Tax. The open-predicate model has been the bottleneck for thirty years. SGF’s closed grammar eliminates the quadratic integration cost. Vocabulary is infinite. Grammar is fixed. Integration cost is linear. The architecture exists today.

For venture capitalists looking for the next infrastructure wave. The market for trustworthy AI coordination is larger than the market for AI inference. The convergence proves the architecture is necessary. The specification is open. The opportunity is in the implementation layer.

For ontologists and knowledge representation researchers. Sowa’s pragmatic cycle has been validated by independent discovery. The fifteen semantic roles are the universal joints of machine meaning. The convergence is evidence that the field is converging on a structural consensus.

For Permion. Your inference engine is a breakthrough. The engineering is real. The architectural layer that makes it scale across organizational boundaries is available now, in the public domain, ready to implement.

...

8. The Invitation

The architecture for trustworthy AI was not designed in a boardroom. It was discovered by elimination. Two independent teams, starting from different premises, arrived at the same structural conclusion. That convergence is evidence that the architecture is necessary, not optional.

Permion built the fastest local-first inference engine in production. Twelve agents. No GPU. Nine thousand tokens per second. The G7 winner.

SGF provides the semantic substrate that makes that engine scalable across organisational boundaries without the Babel Tax.

One builds the machine. The other preserves the meaning.

The code is in the public domain. The specifications are published. The bridge between them has not been built yet.

The blueprints are on the table. The engine is running. The question is no longer whether this architecture works. The question is who will build the integration layer first.

That answer will define the next decade of trustworthy machine intelligence.

...

Learn more about SGF

Neurosymbolic AI To Check and Correct LLMs

Mike's Notes

This is part of a series of thoughtful opinions about using Ontology in software information systems.

Pipi has an existing BORO Engine (bor) (inspired by Chris Partridge's book "Business Objects: Re-engineering for Re-use"), but it runs in reverse: it imports triples to extract entities and relationships, then uses them to build reference relational databases for back-end industry workspaces.

Part three: A presentation by John F. Sowa and Arun K. Majumdar about their Permion software at a recent Ontolog Summit.

Permion is amazingly efficient. The demo ran on a 64 GB MacBook.

Resources

References

  • Business Objects: Re-engineering for Re-use, Chris Partridge. 2005.

Repository

  • Home > Ajabbi Research > Library >
  • Home > Handbook > 

Last Updated

16/08/2026

Neurosymbolic AI To Check and Correct LLMs

By: John F. Sowa and Arun K. Majumdar
Ontolog Summit: 03/06/2026

John F. Sowa and Arun K. Majumdar.

John F. Sowa and Arun K. Majumdar presented "Neurosymbolic AI To Check and Correct LLMs" at the Ontology Summit on 3 June 2026.

Abstract: For over 60 years, the best AI reasoning was based on the four step cognitive cycle:  abduction, deduction, evaluation, induction, and repeat.  Abduction generates hypotheses or educated guesses.  Deduction derives implications.  Evaluation chooses the best option.  Induction combines the result with previous knowledge.

Many versions of the cognitive cycle have been invented and named. For guiding fighter pilots, John Boyd called it the OODA loop: Observe, Orient, Decide, Act.  He originally said that each step would be traversed in milliseconds, but he later applied the loop to design and analysis steps that may take minutes, hours, or days.  Whatever the time scale, the four steps are fundamental to reasoning in science, business, and life.

The pattern matching methods of Large Language Models (LLMs) are superb for translating languages, natural or artificial. They are also good for finding and relating patterns in large volumes of data of any kind. That enables them to answer questions by finding information or by applying previous methods to new data.  For many problems, pattern matching can discover abductions or educated guesses.  But deduction and evaluation cannot be done unless a similar cognitive cycle can be found somewhere on the WWW.

With the VivoMind system from 2000 to 2010, the authors used conceptual graphs for  symbolic reasoning about a wide range of problems. For the new Permion system, they added LLM pattern matching to map conceptual graphs to and from natural language.  But pattern matching, by itself, cannot do any reasoning unless it can find and adapt an appropriate cycle on the WWW.  It often requires a huge amount of searching even for relatively simple examples.

In summary, LLMs cannot do reasoning unless and until the system finds a suitable cognitive cycle on the WWW.  But the Permion reasoning methods automatically do the four-step cycle. If necessary, they can also do LLM searching, but none is required.

YouTube 1:17:07

Why the Triple Is the Wrong Grain

Mike's Notes

This is part of a series of thoughtful opinions about using Ontology in software information systems.

Pipi has an existing BORO Engine (bor) (inspired by Chris Partridge's book "Business Objects: Re-engineering for Re-use"), but it runs in reverse: it imports triples to extract entities and relationships, which are then used to build reference relational databases for back-end industry workspaces.

Part two: This is the view of James Lee Stakelum. Discovered via the Ontolog Forum.

Resources

References

  • Business Objects: Re-engineering for Re-use, Chris Partridge. 2005.

Repository

  • Home > Ajabbi Research > Library > Authors > James Lee Stakelum
  • Home > Ajabbi Research > Library > Authors > John F Sowa
  • Home > Ajabbi Research > Library > Subscriptions > Ontolog Forum
  • Home > Ajabbi Research > Research > Program > Ontology
  • Home > Handbook > 

Last Updated

15/08/2026

Why the Triple Is the Wrong Grain

By: James Lee Stakelum
Medium: 13/07/2026

Epistemic architect and creator of the Symbol Grounding Framework, AI operating systems, machine governance languages, and zero‑integration machine‑to‑machine communication.

...

RDF/OWL was built for a metadata document web and lacks the native structure required for automated machine-to-machine AI communication. The Symbol Grounding Framework (SGF) solves this by replacing the fragile “triple” with the “Synapse” — a holistic atomic unit that locks in event context, provenance, and epistemic status natively. By enforcing a closed grammar of 33 primitives, this architecture guarantees deterministic alignment and prevents data from shattering when meaning crosses system boundaries.

...

The Contract

By the end of this essay, you will have seen twelve things the triple cannot do, eleven conservation laws it violates, and one architecture that satisfies all of them. If even one failure is wrong, discard the argument. But if all twelve hold, the triple must be replaced.

Why Triples Were Chosen

In 1999, the W3C standardized RDF. The web was a document web. Triples were small, simple, and easy to parse. They worked for metadata, for catalog descriptions, for linking resources within a single domain.

Twenty‑five years later, machines act on meaning. They drive cars, diagnose diseases, execute trades, coordinate logistics. The triple has not changed.

The Gearbox Analogy

You cannot solve a gearing problem with a bigger engine. You can only solve it with a gearbox. The industry has been building bigger engines — larger models, longer contexts, more parameters. The triple is still the same single gear. Every new relation needs a new predicate, every new domain needs a new ontology, every new system needs new bilateral mappings. The architecture described here is the gearbox: a closed grammar of 33 primitives — 15 roles, 8 link types, 1 generic verb, 4 identity relations — that never grows. The vocabulary can grow infinitely.

First Principles: What Any Meaning‑Transport Architecture Must Guarantee

When meaning crosses a system boundary, the receiving system must be able to:

  1. Identify what the claim refers to, without ambiguity.
  2. Understand who did what to whom, where, when, how, why.
  3. Know where the claim came from and how it was produced.
  4. Know the epistemic status of the claim — fact, inference, guess, or definition.
  5. Preserve the interpretive context — testimony, verdict, hypothetical.
  6. Separate known facts from unknowns.
  7. Refuse claims that violate local policy.
  8. Guarantee that definitions eventually terminate — no infinite regress.
  9. Represent events as first‑class objects.
  10. Distinguish chronological order from narrative order; truth of saying from truth of what was said.
  11. Support deterministic alignment — verifiable proof, not similarity score.

These eleven requirements are conservation laws for meaning transport. Violate any one, and meaning is lost structurally.

The Thesis

The triple violates eight of these eleven laws. Events are shattered, provenance is optional, epistemic status is absent, context is invisible, conflict cannot be represented, order is flattened, alignment is probabilistic.

Each failure forces a specific architectural component into existence. By the twelfth failure, the entire Symbol Grounding Framework (SGF) emerges — not by invention, but by necessity.

The running example: “Beethoven composed the Ninth Symphony in Vienna in 1824.” A simple claim. The triple cannot represent it correctly.

...

Part I: Structural Failures (Failures 1–3)

Failure 1: The triple cannot represent an event as a whole.

RDF/OWL representation (five triples):

:Beethoven rdf:type :Composer .
:NinthSymphony rdf:type :Symphony .
:Beethoven :composed :NinthSymphony .
:NinthSymphony :composedIn :Vienna .
:NinthSymphony :composedInYear "1824" .

Five triples. The verb :composed is an edge label — nothing anchors the event. Location and time are attached to the symphony, not to the composing. The event is shattered. If a second event says :Beethoven :composed :FifthSymphony, the two events share the same agent node but have no structural boundary.

The triple cannot represent an event as a whole. Therefore the architecture must preserve the event as a single object, with the verb at the center and every participant attached through a named role.

SGF provides the Synapse — a hub‑and‑spoke structure. The verb is the hub (the VerbHub). Participants attach through exactly 15 fixed semantic roles.

Synapse: s1
VerbHub: compose
HAS_AGENT: Beethoven
HAS_PATIENT: Ninth_Symphony
HAS_LOCATION: Vienna
HAS_TIME: 1824

One object. The VerbHub is not an edge label. The event is whole.

...

Failure 2: The triple cannot carry its own provenance.

:Beethoven :composed :NinthSymphony .

This triple is structurally identical whether it came from a scholarly biography or a random comment. Named graphs are optional — provenance can be stripped in transit.

The triple cannot carry its own origin. Therefore every claim must carry its own provenance architecturally, not as an external wrapper.

Every Synapse carries a Derivation Tag — part of its header, not optional. The tag records how the claim entered the graph (EXPRESSED, INFERRED, ASSERTED, PROVISIONAL, GHOST) and includes the source document, byte offset, and content hash.

The Artefact Store Invariant: Every Synapse points to its source artefact. A Synapse without provenance is structurally invalid.

...

Failure 3: The triple cannot carry its own epistemic status.

“Beethoven was born in Bonn” (well‑documented). “Beethoven was born in 1770” (inferred from baptismal records). Both are identical triples. The system cannot distinguish a fact from an inference.

The triple cannot carry its authority level. Therefore every claim must carry its epistemic status natively.

SGF provides a 7‑tier epistemic hierarchy: CORE_DEFINITION, CONSTITUTIVE, SOURCED, CLAIMED, INFERRED, PROVISIONAL, GHOST. Two birth‑related Synapses, two different statuses — the system treats them differently.

...

Part II: Grounding Failures (Failures 4–6)

Failure 4: The triple cannot carry its own grounding.

The URI :Beethoven points to a document, not a concept. Is it the composer, the dog, the crater? The URI does not disambiguate. The ontology is external — if the receiver lacks it, the triple is a dangling reference.

The triple cannot carry its own disambiguation. Therefore every identifier must carry its own sense‑level distinction and trace to a shared foundation.

SGF provides the Canonical ID: en.beethoven.ludwig_van_beethoven.person.core. The microgloss ludwig_van_beethoven distinguishes this sense from others. Every Canonical ID has a finite IS‑A path to the Prime Registry — approximately 65 irreducible semantic primes (DO, HAPPEN, SOMEONE, SOMETHING, GOOD, BAD, etc.). Paths terminate at primes. No infinite regress.

...

Failure 5: The triple cannot represent events in the TBox.

RDF/OWL defines “scalpel” as a subclass of cutting_tool with parts blade and handle. It does not capture what a scalpel does — cut living tissue with precision.

The triple cannot define purpose. Therefore definitions must include events using the same structure as assertions.

SGF defines concepts along three axes: IS‑A (what it is), HAS‑PART (what it has), and DESCRIPTIVE_SYNAPSE (what it does). The VerbHub in a definition is identical to the VerbHub in a claim. The Four Theodore Roosevelts prove that events in the TBox are necessary for entity resolution: four men with the same name and overlapping IS‑A paths are distinguished only by events (San Juan Hill, Utah Beach, investment banking, 19th‑century business). Properties alone fail. Events in definitions are required.

...

Failure 6: The triple cannot distinguish truth of saying from truth of what was said.

“The defendant said ‘I am innocent’” — does the system believe the defendant is innocent, or only that he said it? The triple cannot distinguish.

The triple conflates utterance and content. Therefore the act of saying and the content said must be separate Synapses with separate epistemic statuses.

SGF nests the inner claim within the outer claim. The outer is tagged SOURCED (someone said it). The inner is tagged UNVERIFIED (not yet determined as true). The system can assert the utterance without asserting the content.

...

Part III: Relational Failures (Failures 7–9)

Failure 7: The triple cannot preserve conflicting claims.

Source A: Bonn. Source B: Koblenz. Both asserted as triples. The system cannot represent the conflict without averaging.

The Horowitz Paradox: The average of two conflicting truths is often a third, hallucinated lie that neither source supports. The triple cannot avoid this because it has no mechanism to preserve both claims with provenance.

The triple cannot represent contradiction. Therefore the architecture requires explicit typed links between claims, including CONTRADICTS.

SGF provides 8 link types — PRECEDES, CAUSES, ENABLES, SUPPORTS, CONTRADICTS, ELABORATES, SUPERSEDES, DEPENDS_ON. Conflict is recorded explicitly: Link: s_bonn CONTRADICTS s_koblenz. Query‑time Trust Lenses decide which claims to surface.

...

Failure 8: The triple cannot distinguish chronological order from narrative order.

“The king died. He had eaten poison the night before.” First poison, then death — but the story tells death first. The triple cannot represent both chains.

The triple flattens order. Therefore two distinct link types must exist: one for chronological or causal order (PRECEDES), one for story order (NARRATIVE_NEXT).

SGF stores both chains. The system can query the timeline using PRECEDES, or reconstruct the narrative using NARRATIVE_NEXT.

...

Failure 9: The triple cannot represent a generic relational noun without a new predicate.

“Alice has citizenship in France.” Every relational noun (citizenship, employment, ownership) forces a new predicate in RDF/OWL. The grammar explodes.

The triple cannot absorb domain relations without predicate explosion. Therefore a single generic verb must absorb all relational nouns, with the relation type stored as a concept in an attribute role.

SGF provides RELATES_TO. The relation type is a concept, not a role. Concepts are open. Roles are closed.

...

Part IV: Communication Failures (Failures 10–12)

Failure 10: The triple cannot carry its own act type.

“Beethoven composed the Ninth” — is this an INFORM, a QUERY, or a COMMAND? The triple cannot distinguish.

The triple cannot declare communicative intent. Therefore every message must declare its act type from a fixed, closed set.

SGF provides 13 act types: INFORM, ADVISE, REQUEST, QUERY, COMMAND, PROMISE, PROPOSE, ACCEPT, REFUSE, CANCEL, CONFIRM, ACK, ERROR. The act type is declared, not inferred.

...

Failure 11: The triple cannot carry its own admission context.

A claim from one system may be meaningless to another without shared lexicon, provenance, or integrity checks. The triple has no envelope.

The triple cannot carry the context needed for admission. Therefore an envelope must carry identity, payload, lexical hydration material for unfamiliar terms, integrity checks, and freshness data.

SGF provides the Stranger Rule: any non‑core term arrives with enough material for the receiver to hydrate it — a mini‑lexicon entry with an IS‑A link to the shared Core Lexicon. Two systems that have never met can exchange meaning on first contact.

...

Failure 12: The triple cannot support deterministic alignment.

Two ontologies: :Composer vs :MusicalCreator. RDF/OWL alignment is probabilistic — similarity scores, no proof.

The triple cannot support verifiable alignment. Therefore deterministic comparison requires a closed grammar, Canonical IDs, a Prime Registry, and architectural provenance.

SGF’s alignment engine (SOAM) decomposes both concepts into their Synapses, normalizes through the layered lexicon, and performs recursive bisatisfiability over slot fillers. Every comparison produces either a ProofTrace (verifiable record of every comparison) or a GapReport (exactly which slot failed and how to fix it). Deterministic. Verifiable.

...

But What About OWL?

OWL adds formal semantics, class expressions, and inference to RDF. But it operates on the same atomic substrate: the triple. Every OWL axiom is expressed as triples. The fundamental unit is unchanged.

OWL does not:

  • Make provenance architectural.
  • Make epistemic status native.
  • Distinguish saying from said.
  • Guarantee termination (no prime registry).
  • Support deterministic alignment.
  • Prevent the Horowitz Paradox — OWL has no mechanism to store conflicting claims with provenance.
OWL is a powerful ontology language. It is not a fix for the triple’s structural limitations.

What about SHACL? SHACL adds closed‑world validation. But SHACL’s CWA conflicts with OWL’s OWA. The Oudshoorn proof (2026) demonstrates that reconciling them is ExpTime‑complete — the system may never terminate. This architecture uses a consistent CWA. No reconciliation needed.

...

Why Workarounds Fail

Reification shatters events into 7+ triples. Named graphs add a label but do not change the atom. N‑ary relation patterns require inventing new classes and predicates for every event type. Each workaround adds complexity without correcting the grain. The Synapse embeds all of these features natively.

Silence is structurally superior to confident nonsense. If >2% of terms cannot be resolved, the pipeline halts.

The 11 Conservation Laws

Each law: RDF/OWL fails because ___. The architecture succeeds because ___.

  • Identity Conservation: RDF fails (opaque URIs). Architecture succeeds (Canonical IDs).
  • Role Conservation: RDF fails (open predicates). Architecture succeeds (15 closed roles).
  • Provenance Conservation: RDF fails (named graphs optional). Architecture succeeds (Derivation Tags architectural).
  • Frame Conservation: RDF fails (no native frames). Architecture succeeds (7 frame types).
  • Uncertainty Conservation: RDF fails (OWA conflates known and unknown). Architecture succeeds (epistemic status hierarchy).
  • Consequence Conservation: RDF fails (OWL/SHACL conflict). Architecture succeeds (consistent CWA).
  • Trust Conservation: RDF fails (no native trust). Architecture succeeds (epistemic status hierarchy).
  • Grain Conservation: RDF fails (triple is grain). Architecture succeeds (Synapse is grain).
  • Termination Conservation: RDF fails (no prime registry). Architecture succeeds (Prime Registry).
  • Event Conservation: RDF fails (reification needed). Architecture succeeds (VerbHub native).
  • Governance Conservation: RDF fails (SHACL bolts on). Architecture succeeds (Omega native).
The Separation Rule: Provenance is not trust. Trust is not truth. Context is not source. RDF conflates all four. This architecture keeps them orthogonal.

...

The Necessity Chain

The architecture was discovered through adversarial elimination: start with minimal components, test against failures, add components only when a failure cannot be repaired. Repeat until no new failures appear. The Necessity Chain documents 42 failures. The 33 primitives — 15 roles, 8 link types, 7 frame types, 3 composition mechanisms — are the set for which no counterexample could be found.

Remove any primitive, and the system breaks predictably:

  • Remove HAS_AGENT: cannot distinguish “Alice bit Bob” from “Bob bit Alice.”
  • Remove Derivation Tag: cannot distinguish sourced claim from provisional.
  • Remove Prime Registry: cannot guarantee termination.
  • Remove CONTRADICTS: cannot represent conflicting claims.
  • Remove RELATES_TO: every relational noun forces a new role — predicate explosion returns.

Every component is necessary. None are decorative.

...

Conclusion: The Third Protocol

TCP/IP moved bytes. HTTP moved documents. This architecture moves meaning under discipline.

The triple fails 12 specific capabilities. OWL, SHACL, RDF-star, and every workaround operate on the same broken grain. The Oudshoorn proof shows the Semantic Web stack is internally inconsistent.

The Probabilistic Sandwich: The LLM proposes; the gates dispose. The probabilistic layer never touches the file system. The deterministic graph handles storage, reasoning, and governance. The LLM is encased in a deterministic reliability harness.

The choice is binary. You cannot keep the triple and add OWL, SHACL, or any other patch. The triple is the root. Replace the grain.

Between the Babel Tax and the Stranger Rule. Between probabilistic alignment and deterministic verification. Between a stack that violates 8 of the 11 conservation laws and one that satisfies all 11.

This architecture is the Symbol Grounding Framework (SGF) — an open, freely usable architecture for grounded, transportable, verifiable machine meaning. The Synapse is its atomic unit. The grammar is closed. The vocabulary is infinite.

The specification is published. Build something.

You can learn more about the SGF project here:

Contact: JamesLeeStakelum@Proton.me