The order over time points: the ≤ and < links that stated facts and the point
terms themselves give, and path, which decides whether one point lies at or before
another and names the stated facts behind the answer. A calendar moment compares with
another by its fields and carries no link. TightestStartBoundProver answers
tightestStartBoundOf from the order. See docs/time.md, "The order over time
points".
The order over time points: the `≤` and `<` links that stated facts and the point terms themselves give, and `path`, which decides whether one point lies at or before another and names the stated facts behind the answer. A calendar moment compares with another by its fields and carries no link. `TightestStartBoundProver` answers `tightestStartBoundOf` from the order. See docs/time.md, "The order over time points".
nil, or the context whose visible facts the links read. nil reads every context's believed facts, as the slice ordering does.
nil, or the context whose visible facts the links read. nil reads every context's believed facts, as the slice ordering does.
nil, or an atom of the walks reach has made, keyed [*context* later? start], for a
caller that asks several questions over one belief state (with-memo).
nil, or an atom of the walks `reach` has made, keyed `[*context* later? start]`, for a caller that asks several questions over one belief state (`with-memo`).
nil, or a delay of [[back on] …], the walks back and on (reach) from each node a
caller reconciles at, such as each end of the links arriving. holds? answers p at
or before q without a walk of its own when one node's walks reach p back and q on.
nil, or a delay of `[[back on] …]`, the walks back and on (`reach`) from each node a caller reconciles at, such as each end of the links arriving. `holds?` answers `p` at or before `q` without a walk of its own when one node's walks reach `p` back and `q` on.
(calendar-moment x)[frame fields] of the node x when the calendar places it (timepoint/moment, or a
point of an InstantFn moment), else nil.
`[frame fields]` of the node `x` when the calendar places it (`timepoint/moment`, or a point of an `InstantFn` moment), else nil.
(holds? kb strict? p q)Presence check before path: false when path answers nil for these arguments, true
when it may answer. Decides by the terms (by-terms), then by the walks *through*
holds, then by graph/reaches? over the links, where a node the calendar places counts
as reaching.
Presence check before `path`: false when `path` answers nil for these arguments, true when it may answer. Decides by the terms (`by-terms`), then by the walks `*through*` holds, then by `graph/reaches?` over the links, where a node the calendar places counts as reaching.
The functors of every fact sentence-links reads a link from.
The functors of every fact `sentence-links` reads a link from.
(path kb strict? p q)The sentexes showing the node p lies before q (strict?) or at or before it, or
nil when neither the links nor the calendar show it. Two calendar moments compare by
their fields alone, with no sentex; any other pair by a walk from each end
(reach), joined at a node both reach or through the calendar (calendar-paths), when
holds? answers true. Of several, the path with the fewest sentexes, then first in
content order. Reads the facts *context* sees.
The sentexes showing the node `p` lies before `q` (`strict?`) or at or before it, or nil when neither the links nor the calendar show it. Two calendar moments compare by their fields alone, with no sentex; any other pair by a walk from each end (`reach`), joined at a node both reach or through the calendar (`calendar-paths`), when `holds?` answers true. Of several, the path with the fewest sentexes, then first in content order. Reads the facts `*context*` sees.
(reach kb later? start)Every node a breadth-first walk from start reaches over the links (later nodes when
later?), as {[node strict?] path}: the first path reaching the node, and the first
reaching it across a strict link, each the vector of sentexes its stated links read.
start itself is [start false] with an empty path.
Every node a breadth-first walk from `start` reaches over the links (later nodes when
`later?`), as `{[node strict?] path}`: the first path reaching the node, and the first
reaching it across a strict link, each the vector of sentexes its stated links read.
`start` itself is `[start false]` with an empty path.(readings x)The [start end] pairs of nodes the time x can be read as: [x x] for an
InstantFn moment, the term's own start and end points for any other ground compound,
and both for a symbol, which can name a moment or a thing with extent.
The `[start end]` pairs of nodes the time `x` can be read as: `[x x]` for an `InstantFn` moment, the term's own start and end points for any other ground compound, and both for a symbol, which can name a moment or a thing with extent.
(sentence-links sentence)The links the stated fact sentence gives, [lower upper strict?], or nil when its
functor is not among link-heads or its arity does not fit.
The links the stated fact `sentence` gives, `[lower upper strict?]`, or nil when its functor is not among `link-heads` or its arity does not fit.
(tightest-start-bound-prover)The prover answering tightestStartBoundOf from this order, which add-reasoner :tightest-start-bound registers.
The prover answering `tightestStartBoundOf` from this order, which `add-reasoner :tightest-start-bound` registers.
(tightest-start-bounds kb context x)The nodes a start of x (readings) lies at or after through at least one stated
fact, kept when every other such node lies at or before it (path), in content order.
Two unordered bounds keep neither. Reads the facts visible from context, or every
context's when it is a variable.
The nodes a start of `x` (`readings`) lies at or after through at least one stated fact, kept when every other such node lies at or before it (`path`), in content order. Two unordered bounds keep neither. Reads the facts visible from `context`, or every context's when it is a variable.
(with-memo & body)Run body with the walks shared across its path questions. The caller holds belief
fixed over body's reads of the links.
Run `body` with the walks shared across its `path` questions. The caller holds belief fixed over `body`'s reads of the links.
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 |