memory_relation_define
Define a new relation type in the knowledge graph when built-ins don't fit, specifying inverse, entity type expectations, and transitivity.
Instructions
Add a relation to the closed graph vocabulary — a deliberate, rare act. Prefer the builtins; define one only when a recurring connection genuinely fits none of them.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| name | Yes | The new relation name, hyphenated like the builtins. | |
| dst_type | No | Soft entity-kind expectation for the object; a mismatch warns, never rejects. | |
| src_type | No | Soft entity-kind expectation for the subject; a mismatch warns, never rejects. | |
| inverse_of | No | Pair with an existing relation, as ``runs-on`` is the inverse of ``hosts``. | |
| transitive | No | True closes the relation transitively, so chained edges arrive pre-derived. | |
| description | Yes | What the relation means, for later readers. |
Output Schema
| Name | Required | Description | Default |
|---|---|---|---|
No arguments | |||