Canonical RDomain Structure
Traversal Profiles
Traversal Profiles specify how graph navigation proceeds within the domain: depth limits, allowed or blocked predicates, temporal windows and epistemic filtering.
Traversal Control Graph
Traversal is constrained by multiple filters applied cumulatively.
Depth Budget Graph
Traversal depth should be explicit and justified by the domain use case.
Traversal Policy Matrix
| Control | Purpose | Typical declaration |
|---|---|---|
| Depth limit | Prevents unbounded graph expansion. | Maximum hops by use case or query class. |
| Predicate policy | Admits or blocks particular edge types. | Allow-list, deny-list or contextual weighting. |
| Temporal filter | Limits traversal to relevant validity windows. | Current-state only, as-of date or interval overlap. |
| Epistemic filter | Constrains paths by evidence status or confidence. | Verified only, corroborated only or confidence threshold. |