Positive rewriteOf queries over reader representatives, above raw fact retrieval.
Positive rewriteOf queries over reader representatives, above raw fact retrieval.
(affected-consumers kb source)The syntax census when a source can change a rewrite answer, otherwise nil. Consumers rejoin in FULL: a rival alias can expose a fallback answer that does not rest on the rival's handle, so a supporting-only delta is not sound here.
The syntax census when a source can change a rewrite answer, otherwise nil. Consumers rejoin in FULL: a rival alias can expose a fallback answer that does not rest on the rival's handle, so a supporting-only delta is not sound here.
(applicable? kb goal reader)Can this positive binary goal read an actual rewriteOf row, including an open head?
Can this positive binary goal read an actual rewriteOf row, including an open head?
The syntax-only T2 census: rule ids reading positive rewrite queries, not verdicts.
The syntax-only T2 census: rule ids reading positive rewrite queries, not verdicts.
(counter-certificates kb {:keys [goal handle outputs head proposal]} reader)Positive counter-readings of one firing association at reader.
Fixed inputs retain public endpoint normalization; ONLY the former newly bound
outputs are compared as values. Re-normalizing those outputs would hide a change.
This returns proof-specific guard ingredients, never a global defeat or stored edit.
An open application association rechecks its raw proposal as its matcher did.
Positive counter-readings of one firing association at `reader`. Fixed inputs retain public endpoint normalization; ONLY the former newly bound outputs are compared as values. Re-normalizing those outputs would hide a change. This returns proof-specific guard ingredients, never a global defeat or stored edit. An open application association rechecks its raw proposal as its matcher did.
(endpoint kb reader term)A rewriteOf endpoint read as a term by reader, never as an equation mention.
Existing closed applications may resolve, but unknown ones remain written and no
placeholder is allocated. The second representative walk covers a resolved alias.
This does not change raw storage or the mention policy of any other equation.
A rewriteOf endpoint read as a term by `reader`, never as an equation mention. Existing closed applications may resolve, but unknown ones remain written and no placeholder is allocated. The second representative walk covers a resolved alias. This does not change raw storage or the mention policy of any other equation.
(endpoint-reading kb reader term)The endpoint and the actual resolver readings used to compute it. This is evidence input, NOT yet a support certificate: tuple fan/permutation and source roles must be retained by the semantic consumer. No alternative resolver or allocation is introduced, and ordinary endpoint calls do not record events.
The endpoint and the actual resolver readings used to compute it. This is evidence input, NOT yet a support certificate: tuple fan/permutation and source roles must be retained by the semantic consumer. No alternative resolver or allocation is introduced, and ordinary endpoint calls do not record events.
(fact-matches kb goal reader)The public fact leaf reading positive rewrite witnesses through representatives. Other stored predicates retain the existing retrieval path, including negation and sameAs/equals. Do not union a second raw rewrite channel with canonical bindings.
The public fact leaf reading positive rewrite witnesses through representatives. Other stored predicates retain the existing retrieval path, including negation and sameAs/equals. Do not union a second raw rewrite channel with canonical bindings.
(head-certificates kb goal head rule-h reader)Supported public matches of a lazy rule's already-ground consequent. The raw head is derived by the rule/body proof, NOT a fabricated stored equation. Its association retains that raw head so counterguards can re-read it at each reader.
Supported public matches of a lazy rule's already-ground consequent. The raw head is derived by the rule/body proof, NOT a fabricated stored equation. Its association retains that raw head so counterguards can re-read it at each reader.
(head-reader kb reader)The public backward-head capability, separate from raw rule storage/unification. A raw body-bound head is read only once its inputs are ground. Ordinary heads use their original unifier; this capability introduces no stored predicate.
The public backward-head capability, separate from raw rule storage/unification. A raw body-bound head is read only once its inputs are ground. Ordinary heads use their original unifier; this capability introduces no stored predicate.
(head-reader-contexts kb handles)Lazy-head readers from normalization sources and the actual rule/body supports. Including the latter keeps a source-free raw head readable in its own context. This is discovery only; each head certificate and the firing's placement admit it.
Lazy-head readers from normalization sources and the actual rule/body supports. Including the latter keeps a source-free raw head readable in its own context. This is discovery only; each head certificate and the firing's placement admit it.
(match-certificates kb goal reader)The same public matches with positive source alternatives and proof-local roles. The literal forward join and proof-specific counterguards consume these, without adding normalization sources to unrelated prover-registry summaries.
The same public matches with positive source alternatives and proof-local roles. The literal forward join and proof-specific counterguards consume these, without adding normalization sources to unrelated prover-registry summaries.
(matches kb goal reader)Positive rewrite witnesses as [handle bindings stored-record] for goal.
Canonicalize before unifying, including repeated variables and closed endpoints.
Returned records are the actual as-authored rows, never fabricated self edges.
This is a read computation only; callers deriving facts must additionally carry the
normalization supports rather than treating a canonical sentence as stored.
Positive rewrite witnesses as `[handle bindings stored-record]` for `goal`. Canonicalize before unifying, including repeated variables and closed endpoints. Returned records are the actual as-authored rows, never fabricated self edges. This is a read computation only; callers deriving facts must additionally carry the normalization supports rather than treating a canonical sentence as stored.
(matches-with-readings kb goal reader)The SAME positive rewrite matcher with a fourth item containing actual resolver readings. A consumer must turn those readings into a supported proof with explicit source roles and reader maintenance; candidate events alone grant no authority.
The SAME positive rewrite matcher with a fourth item containing actual resolver readings. A consumer must turn those readings into a supported proof with explicit source roles and reader maintenance; candidate events alone grant no authority.
Static normalizer sources. Value-predicate sources are discovered through fCP slots.
Static normalizer sources. Value-predicate sources are discovered through fCP slots.
(note-consumer! kb bucket handle present?)Mirror a rule-index change, idempotently, in the existing taxonomy atom. Called only in the reasoning/index phase, never by records-only edits. A missing older-image census stays cold until a sparse index reconstruction can fill it.
Mirror a rule-index change, idempotently, in the existing taxonomy atom. Called only in the reasoning/index phase, never by records-only edits. A missing older-image census stays cold until a sparse index reconstruction can fill it.
(positive-query-consumer? queries)Do these query bodies actually read a positive rewrite literal? Dependency keys such as a different guard's equality sources do not establish query syntax.
Do these query bodies actually read a positive rewrite literal? Dependency keys such as a different guard's equality sources do not establish query syntax.
(possible-consumers? kb)Queue-only observer presence check: no index read, including while an older image is cold.
Queue-only observer presence check: no index read, including while an older image is cold.
(reader-contexts kb)Candidate readers across ALL source contexts, including dynamically named correspondence tuple predicates and their fans. Only rewrite consumers call this; ordinary computed antecedents keep the existing census. Computation checks each reader.
Candidate readers across ALL source contexts, including dynamically named correspondence tuple predicates and their fans. Only rewrite consumers call this; ordinary computed antecedents keep the existing census. Computation checks each reader.
(reading-evidence kb reader events)Positive source alternatives for actual resolver readings; no candidate row is admitted by this function. The raw rewrite witness is a separate strict ingredient. Absence/uniqueness still requires the consumer's reader-specific recheck. This helper is not a registered prover or a generalized forced-conclusion capability.
Positive source alternatives for actual resolver readings; no candidate row is admitted by this function. The raw rewrite witness is a separate strict ingredient. Absence/uniqueness still requires the consumer's reader-specific recheck. This helper is not a registered prover or a generalized forced-conclusion capability.
(rebuild-consumers! kb)Rebuild the syntax census after recovery. No belief or rule body is inferred.
Rebuild the syntax census after recovery. No belief or rule body is inferred.
(row-readings kb handle reader)Canonical facts and resolver readings for an actual visible stored rewrite handle. These are counter-reading INPUTS for proof-specific maintenance, not a certificate or permission to defeat a row globally. Raw storage and directed provenance stay put.
Canonical facts and resolver readings for an actual visible stored rewrite handle. These are counter-reading INPUTS for proof-specific maintenance, not a certificate or permission to defeat a row globally. Raw storage and directed provenance stay put.
(watched-consumer? kb handle dropping-id)Actual rewrite queries of the rule and its remaining exception bodies. Inspect only the named rule and sparse handle-reference postings, never all rules.
Actual rewrite queries of the rule and its remaining exception bodies. Inspect only the named rule and sparse handle-reference postings, never all rules.
cljdoc builds & hosts documentation for Clojure/Script libraries
| Ctrl+k | Jump to recent docs |
| ← | Move to previous article |
| → | Move to next article |
| Ctrl+/ | Jump to the search field |