windags-decomposer

Convert a ProblemUnderstanding into a validated DAG with nodes, edges, and skill assignments.

2|Updated Feb 11, 2026
One-click install
npx skills add https://github.com/curiositech/port-daddy --skill windags-decomposer
Or copy as Structured Prompt for Agent
Please help me install this Agent Skill.
Skill: windags-decomposer
Source: https://github.com/curiositech/port-daddy/tree/main/skills/windags-decomposer
Command: npx skills add https://github.com/curiositech/port-daddy --skill windags-decomposer

SYSTEM DOCUMENTATION & REQUIREMENTS

What problem does it solve?

Decomposer coordinates the extraction of a ProblemUnderstanding and the generation of a validated DecompositionResult, delivering a structured DAG with nodes, edges, skill assignments, wave definitions, and commitment levels.

Core Features & Use Cases

  • Produces concrete DAGs ready for wave planning and execution
  • Enforces three-pass decision logic and vague-node handling
  • Validates topological order, dependency constraints, and commitment distributions

Quick Start

Provide a complete decomposition for a given ProblemUnderstanding input and emit a DecompositionResult with nodes, edges, wave definitions, and commitment levels.

Frequently Asked Questions about windags-decomposer

High-intent search queries and answers about installing and using this skill.

FAQPage Schema
How do I decompose a complex problem into a DAG with validated dependencies?

Decomposing a problem into a validated DAG involves converting a ProblemUnderstanding into a DecompositionResult with nodes, edges, skill assignments, wave definitions, and commitment levels. The process enforces three-pass decisions and ensures topological correctness for execution readiness.

What is wave planning in task decomposition and when do I need it?

Wave planning in task decomposition organizes DAG nodes into sequential execution waves with assigned commitment levels. You need it when orchestrating end-to-end workflows that require validated topological order and dependency constraints before parallel or sequential execution.

How do I validate topological order and dependency constraints in a task DAG?

Validating topological order in a task DAG requires enforcing three-pass decision logic and checking dependency constraints during decomposition. This ensures the generated DecompositionResult maintains correct node ordering and valid commitment distributions for wave planning.

Can I use DAG decomposition for vague or underspecified task nodes?

DAG decomposition supports vague-node handling through its three-pass decision logic. When converting a ProblemUnderstanding into a DecompositionResult, it processes underspecified nodes and enforces commitment levels to produce a concrete DAG ready for execution.

What's the best way to assign skills and commitment levels across DAG nodes?

Assigning skills and commitment levels across DAG nodes is handled during decomposition by converting a ProblemUnderstanding into a structured DecompositionResult. The process validates dependency constraints and distributes commitment levels to ensure topological correctness.

Why does my task decomposition fail dependency validation checks?

Task decomposition fails dependency validation when the generated DAG violates topological order or commitment distribution constraints. The decomposer enforces three-pass decisions and validates dependencies to ensure the DecompositionResult maintains structural correctness before wave planning.