The point algebra over time instants as a vaelii.impl.qcn relation algebra and a
qcn-kb calculus: three base relations, three derived predicates, nodes including a
thing's point terms and calendar moments (vaelii.impl.timepoint), and
IncludesInstantProver, which reads a thing against a moment off the network. See
docs/time.md and docs/qcn.md.
The point algebra over time instants as a `vaelii.impl.qcn` relation algebra and a `qcn-kb` calculus: three base relations, three derived predicates, nodes including a thing's point terms and calendar moments (`vaelii.impl.timepoint`), and `IncludesInstantProver`, which reads a thing against a moment off the network. See docs/time.md and docs/qcn.md.
The three instant relations: the universe of the algebra.
The three instant relations: the universe of the algebra.
Base relation keyword → the binary predicate a fact about it is stored under.
Base relation keyword → the binary predicate a fact about it is stored under.
(compose s1 s2)The composition of two relation sets: the union of the table entries over every member pair.
The composition of two relation sets: the union of the table entries over every member pair.
(converse-set rels)The converse of a relation set.
The converse of a relation set.
(includes-instant-prover)The prover answering includesInstant off the point network, to register with
vaelii.core/add-prover.
The prover answering `includesInstant` off the point network, to register with `vaelii.core/add-prover`.
Every instant predicate — the three base ones and the three derived ones — mapped to the
set of base relations it denotes. A goal (P a b) is entailed exactly when the relations
still possible between a and b are a subset of P's denotation.
Every instant predicate — the three base ones and the three derived ones — mapped to the set of base relations it denotes. A goal `(P a b)` is entailed exactly when the relations still possible between a and b are a subset of P's denotation.
The point algebra as a vaelii.impl.qcn-kb calculus, with timepoint/constraints-over
as its node-set narrowing.
The point algebra as a `vaelii.impl.qcn-kb` calculus, with `timepoint/constraints-over` as its node-set narrowing.
The point algebra as a vaelii.impl.qcn relation algebra.
The point algebra as a `vaelii.impl.qcn` relation algebra.
(get-in point-composition [r1 r2]) is the set of base relations possible between a and
c given r1(a,b) and r2(b,c).
`(get-in point-composition [r1 r2])` is the set of base relations possible between a and c given `r1`(a,b) and `r2`(b,c).
(point-prover)The point-algebra entailment prover, to register with vaelii.core/add-prover.
The point-algebra entailment prover, to register with `vaelii.core/add-prover`.
(possible-point-relations kb context i1 i2)The base relations still possible between instants i1 and i2 given everything
believed in context — #{} when the network is inconsistent.
The base relations still possible between instants `i1` and `i2` given everything
believed in `context` — `#{}` when the network is inconsistent.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 |