Apodicta and the category
A rules engine looks up. This derives the structure, then reasons inside it.
The usual answer to a model that guesses is a system that cannot: a rules engine, with the logic written out in advance. It is the honest opposite of a language model, and its limits are the mirror image too. It holds exactly as far as somebody thought ahead.
Rules engines · and what Apodicta does instead
- The category A hand-authored set of if-this-then-that mappings, frequently marketed as an ontology. Somebody wrote every branch.
- Apodicta Derives the structure of each problem, per case, from the governing authority itself. No pre-built tables, no answer keys.GATED
- The category Genuinely deterministic, and genuinely fixed. Every rule, every table and every answer key is written in advance, by people.
- Apodicta Deterministic where it counts, at the boundary, while the model stays free to propose anything inside it.GATED
- The category It does not reason. It looks up, and it can only look up what somebody anticipated.
- Apodicta It poses its own questions, tests each theory against the record for contradiction, and proves or refuses every step.GATED
- The category One line item changes, a new statute or a case nobody anticipated, and it breaks or waits for a human to author the next rule.
- Apodicta The structure is re-derived from the authority, so a change in the authority is read rather than re-coded.GATED
- The category Every domain has to be hand-built, again, by people who know that domain.
- Apodicta One engine, any field: law, medicine, machinery, finance. The shape beneath the words is what it works on.GATED
Where the category is the right choice
When the domain really is closed, a rules engine is the right build and probably the cheaper one. Fee schedules, filing deadlines, conflict checks, eligibility screens, anything where the branches are known and the cost of a surprise is low: write the rules, audit them, and you have a system you can explain to anyone in a meeting. You also get an audit trail for free, which is worth a great deal.
The place it stops paying is where the interesting work in a defender office lives: a record nobody indexed, a theory nobody wrote a branch for, an authority that moved last term. A lookup table cannot form a hypothesis, and it cannot tell you that the one it would have given you is contradicted by a timestamp in the discovery.
The longer versions
What deterministic means when a vendor says itis the article to read before the next demo. How it works shows the relationship engine and the reductio step, and reductio is the word for what it does to a theory.