Every pair of datings stands in exactly one of Allen's thirteen relations, computed on the modelled interval [eff_start, eff_end] and published under lado:possibly*. Complete means countable: the numbers below add up to all 820 pairs of 41 findspots, so a missing relation is a missing pair rather than a silence that could mean anything. Note how lopsided the result is — two thirds of all pairs are simple precedence, which is what a corpus spread over three centuries looks like.
?assertions by ?relation
Also available as a plain file:
allen-possible.rq.
The graph is fetched as a static file and queried in your browser with
rdflib under Pyodide — there is no endpoint, and nothing you type
leaves your machine.