query_intersect
Answer a conjunctive query: concepts reachable from EVERY anchor at once (A AND B).
query_ckg walks outward from one concept. This intersects the reachable sets of two or more, which is the shape of most real questions — "the component that satisfies A AND applies to B". Neither anchor alone answers it; the answer lives in the overlap.
Every branch is an exact set of declared edges, so the intersection is exact. A concept appears only if a declared path reaches it from each anchor. A relation missing from the graph produces an empty result, never a guess.
Args:
branches: Two or more branches. Either a bare anchor ("TensorRT-LLM"), which takes
everything within depth hops, or an anchor plus an explicit relation path using
'>' ("TensorRT-LLM > REQUIRES > ENABLES"), where each relation replaces the
frontier. '*' matches any relation. Mix both forms freely.
depth: Hops for bare-anchor branches, 1-5 (default 2). Ignored for explicit paths.
direction: 'out' follows dependencies, 'in' follows them backwards, 'both' (default).
mode: 'AND' (default) intersects branches; 'OR' unions them.
limit: Max concepts listed, 1-200 (default 40). The true count is always shown.
Returns: Markdown with the query plan and its per-step set sizes, then the answer set with taxonomy tags. Reports which branch was empty when the intersection is empty.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| mode | No | AND | |
| depth | No | ||
| limit | No | ||
| branches | Yes | ||
| direction | No | both |
Output Schema
| Name | Required | Description | Default |
|---|---|---|---|
| result | Yes |