← NPL tag reference

<npl-poa>

Decision-tree pump: a mermaid diagram of candidate paths with weights, explicit reasoning, and the selected path.

Makes implicit decisions visible before execution — what was considered, what was chosen, and why. Weights are preference scores, not probabilities, and every edge needs a matching reasoning entry. Emit when there is a genuine fork with meaningfully different outcomes; re-emit when the tree changes.

Attributes

Minimal example

<npl-poa>
  ```mermaid
  graph LR
    A{Cache strategy?} -->|"85%"| B[Redis + TTL]
    A -->|"40%"| C[In-memory LRU]
  ```
  <reasoning>A --[85%]--> B: Redis is already in the stack.</reasoning>
  <selected>Redis + TTL (85%).</selected>
</npl-poa>