Allen's interval algebra as a vaelii.impl.qcn relation algebra and a qcn-kb
calculus: thirteen base relations, seven derived predicates, the transcribed composition
table, and the two narrowings, metric (stp) and point (points-narrowing-with-support).
See docs/time.md and docs/qcn.md.
Allen's interval algebra as a `vaelii.impl.qcn` relation algebra and a `qcn-kb` calculus: thirteen base relations, seven derived predicates, the transcribed composition table, and the two narrowings, metric (`stp`) and point (`points-narrowing-with-support`). See docs/time.md and docs/qcn.md.
The thirteen interval relations: the universe of the algebra.
The thirteen interval relations: the universe of the algebra.
Allen's interval algebra as a vaelii.impl.qcn-kb calculus, narrowed by
both-narrowings (:sources and :contexts: docs/stp.md). subintervalOf and
properSubintervalOf are typed: the network answers them only over arguments their
declared types admit.
Allen's interval algebra as a `vaelii.impl.qcn-kb` calculus, narrowed by `both-narrowings` (`:sources` and `:contexts`: docs/stp.md). `subintervalOf` and `properSubintervalOf` are typed: the network answers them only over arguments their declared types admit.
Allen's interval algebra as a vaelii.impl.qcn relation algebra.
Allen's interval algebra as a `vaelii.impl.qcn` relation algebra.
The Allen composition table: (get-in allen-composition [r1 r2]) is the set of base
relations possible between A and C given r1(A,B) and r2(B,C).
The Allen composition table: `(get-in allen-composition [r1 r2])` is the set of base relations possible between A and C given `r1`(A,B) and `r2`(B,C).
(allen-predicates)Every predicate the Allen calculus reads: the sources a SupportingProver whose
answer depends on the interval network names.
Every predicate the Allen calculus reads: the sources a `SupportingProver` whose answer depends on the interval network names.
(allen-prover)The interval-algebra entailment prover, to register with vaelii.core/add-prover.
The interval-algebra entailment prover, to register with `vaelii.core/add-prover`.
(allen-support kb context i1 i2)The handles of the stored sentexes the relation set between i1 and i2 rests on —
possible-allen-relations' support (qcn-kb/support), #{} for an unconstrained
pair.
The handles of the stored sentexes the relation set between `i1` and `i2` rests on —
`possible-allen-relations`' support (`qcn-kb/support`), `#{}` for an unconstrained
pair.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.
Every interval predicate — the thirteen base ones and the seven derived ones — mapped
to the set of base relations it denotes. A goal (P i j) is entailed exactly when the
relations still possible between i and j are a subset of P's denotation.
Every interval predicate — the thirteen base ones and the seven derived ones — mapped to the set of base relations it denotes. A goal `(P i j)` is entailed exactly when the relations still possible between i and j are a subset of P's denotation.
(possible-allen-relations kb context i1 i2)The Allen base relations still possible between intervals i1 and i2 given
everything believed in context — #{} when the network is inconsistent.
The Allen base relations still possible between intervals `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 |